A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints.
John J. H. ForrestJayant KalagnanamLaszlo LadányiPublished in: INFORMS J. Comput. (2006)
Keyphrases
- knapsack problem
- column generation
- linear relaxation
- linear programming relaxation
- optimal solution
- integer program
- cutting plane
- linear programming problems
- constraint programming
- set partitioning
- linear program
- combinatorial optimization problems
- decision variables
- integer programming
- branch and bound
- linear programming
- lagrangean relaxation
- mixed integer programming
- np hard
- linear constraints
- dual variables
- optimization problems
- dynamic programming
- multidimensional knapsack problem
- lagrangian relaxation
- exact algorithms
- greedy algorithm
- lp relaxation
- vehicle routing
- vehicle routing problem with time windows
- implicit enumeration
- multiple objectives
- constraint satisfaction
- exact solution
- integer linear programming
- branch and bound algorithm
- dantzig wolfe
- machine learning
- global constraints
- genetic algorithm