Solving sequential knapsack problems.
Mark HartmannTodd OlmsteadPublished in: Oper. Res. Lett. (1993)
Keyphrases
- knapsack problem
- implicit enumeration
- randomly generated test instances
- combinatorial optimization problems
- dynamic programming
- optimal solution
- linear relaxation
- optimization problems
- cutting plane
- test problems
- production planning
- exact algorithms
- linear programming relaxation
- np hard problems
- combinatorial optimization
- np hard
- continuous relaxation
- greedy algorithm
- integer variables
- bicriteria
- dna computing
- linear programming problems
- cost function
- linear constraints
- neural network