Approximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities.
Igor S. LitvinchevLuis InfanteEdith Lucero Ozuna EspinosaPublished in: ICCL (2014)
Keyphrases
- integer programming
- packing problem
- valid inequalities
- integer programming formulations
- cutting plane algorithm
- network design problem
- mixed integer linear programs
- column generation
- cutting plane
- linear programming
- linear programming relaxation
- np hard
- lagrangian relaxation
- constraint programming
- production planning
- integer programming formulation
- exact solution
- integer program
- network flow
- facet defining inequalities
- mixed integer programming
- np complete
- high dimensional