Improving problem reduction for 0-1 Multidimensional Knapsack Problems with valid inequalities.
Hanyu GuPublished in: Comput. Oper. Res. (2016)
Keyphrases
- valid inequalities
- multidimensional knapsack problem
- integer programming
- lagrangian relaxation
- mixed integer linear programs
- traveling salesman problem
- cutting plane
- mixed integer programming
- lower and upper bounds
- linear programming
- knapsack problem
- mixed integer
- feasible solution
- convex hull
- column generation
- primal dual
- integer program
- genetic algorithm
- tabu search
- facet defining inequalities
- network flow
- network design problem
- continuous relaxation
- np hard