A note on the integrality gap of cutting and skiving stock instances.
John MartinovicPublished in: 4OR (2022)
Keyphrases
- integrality gap
- linear programming relaxation
- valid inequalities
- linear program
- lower bound
- integer programming formulation
- arbitrarily close
- approximation algorithms
- linear programming
- randomly generated
- knapsack problem
- integer programming
- primal dual
- mixed integer programming
- integer program
- feasible solution
- finite number
- quadratic assignment problem
- constraint satisfaction problems
- column generation
- low degree
- randomly generated problems
- mixed integer
- lower and upper bounds
- genetic algorithm
- branch and bound
- optimal solution