New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem.
Isabel FriedowGuntram ScheithauerPublished in: OR (2014)
Keyphrases
- packing problem
- fixed width
- integer programming
- valid inequalities
- linear programming relaxation
- linear programming
- linear inequalities
- integer solution
- lower bound
- sufficient conditions
- sliding window
- np hard
- facet defining inequalities
- planar graphs
- semidefinite
- lp relaxation
- knapsack problem
- linear program
- real time
- approximation algorithms
- subtour elimination
- database
- mixed integer linear programs
- convex relaxation