Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem.
Elif Ilke GokceWilbert E. WilhelmPublished in: Discret. Optim. (2015)
Keyphrases
- valid inequalities
- multi dimensional
- integer programming
- traveling salesman problem
- mixed integer
- mixed integer programming
- feasible solution
- convex hull
- linear programming
- cutting plane algorithm
- lower and upper bounds
- mixed integer linear programs
- column generation
- cutting plane
- linear programming relaxation
- network design problem
- integer programming formulation
- randomly generated problems
- primal dual
- integer program
- capacitated fixed charge
- production planning
- high dimensional
- facet defining inequalities
- constraint programming
- combinatorial optimization
- linear program
- data structure
- continuous variables
- tabu search
- np hard
- lower bound