Using Valid Inequalities and Different Grids in LP-Based Heuristic for Packing Circular Objects.
Igor S. LitvinchevLuis InfanteEdith Lucero Ozuna EspinosaPublished in: ACIIDS (2) (2016)
Keyphrases
- valid inequalities
- mixed integer programming
- linear programming
- capacitated fixed charge
- feasible solution
- linear programming relaxation
- integer programming
- packing problem
- lower and upper bounds
- lp relaxation
- mixed integer
- mixed integer program
- cutting plane algorithm
- lagrangian relaxation
- network design problem
- optimal solution
- traveling salesman problem
- integer programming formulation
- cutting plane
- column generation
- mixed integer linear programs
- convex hull
- linear program
- lot sizing
- lower bound
- integer program
- linear relaxation
- integrality gap
- primal dual
- genetic algorithm
- np hard
- dynamic programming
- search algorithm
- combinatorial optimization
- facet defining inequalities