Packing into the smallest square: Worst-case analysis of lower bounds.
Alberto CapraraAndrea LodiSilvano MartelloMichele MonaciPublished in: Discret. Optim. (2006)
Keyphrases
- worst case analysis
- lower bound
- worst case
- linear programming relaxation
- upper bound
- average case
- branch and bound
- greedy heuristic
- branch and bound algorithm
- np hard
- packing problem
- np hardness
- lower and upper bounds
- optimal solution
- objective function
- vc dimension
- column generation
- integer programming
- knapsack problem
- theoretical analysis
- lagrangian relaxation
- model selection
- cost function
- active learning