An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem.
Silvano MartelloPaolo TothPublished in: Oper. Res. (2003)
Keyphrases
- knapsack problem
- exact algorithms
- combinatorial optimization problems
- decision variables
- optimization problems
- optimal solution
- dynamic programming
- test problems
- shortest path problem
- integer variables
- linear programming relaxation
- bicriteria
- np hard
- multidimensional knapsack problem
- np hard problems
- continuous relaxation
- greedy algorithm
- multiple objectives
- cutting plane
- heuristic solution
- greedy heuristic
- branch and bound algorithm
- neural network
- evolutionary algorithm
- linear constraints
- column generation
- integer programming