A linear-time algorithm for solving continuous maximin knapsack problems.
Takahito KunoHiroshi KonnoEitan ZemelPublished in: Oper. Res. Lett. (1991)
Keyphrases
- knapsack problem
- randomly generated test instances
- implicit enumeration
- combinatorial optimization problems
- optimization problems
- optimal solution
- dynamic programming
- linear relaxation
- np hard
- greedy algorithm
- integer variables
- exact algorithms
- combinatorial optimization
- bicriteria
- test problems
- graph theory
- cutting plane
- linear programming relaxation
- production planning
- piecewise linear
- feasible solution
- integer program
- upper bound
- maximum profit