Abstract

AnO (n+r logn) algorithm is presented for the linear programming knapsack problem withr generalized upper bounds andn variables. This result which is based on parametric programming and well-known ideas for the design of linear-time algorithms improvesO (n logn) algorithms given byGlover/Klingman [1979] andZemel [1980].

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call