Creating Worst-Case Instances for Lower Bounds of the 2D Strip Packing Problem.
Torsten BuchwaldGuntram ScheithauerPublished in: OR (2016)
Keyphrases
- lower bound
- worst case
- lower and upper bounds
- upper bound
- approximation algorithms
- quadratic assignment problem
- branch and bound algorithm
- random instances
- linear programming relaxation
- np hard
- branch and bound
- randomly generated
- integer programming formulations
- set of randomly generated instances
- families of valid inequalities
- exact methods
- running times
- average case
- objective function
- optimal solution
- vc dimension
- greedy algorithm
- data streams
- packing problem
- sample size
- sample complexity
- constant factor
- worst case analysis
- optimal cost
- finding optimal solutions
- integer programming
- integrality gap
- randomly generated problems
- online algorithms
- lagrangian relaxation
- pac learning