Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem.
Dominique QuadriÉric SoutifPublished in: Oper. Res. (2007)
Keyphrases
- integer variables
- knapsack problem
- objective function
- optimal solution
- optimization problems
- dynamic programming
- branch and bound algorithm
- continuous variables
- cutting plane
- continuous relaxation
- greedy algorithm
- np hard
- network design problem
- decision variables
- production planning
- linear programming relaxation
- lp relaxation
- computational complexity
- worst case
- linear programming
- mixed integer