Exploiting Packing Components in General-Purpose Integer Programming Solvers.
Jakub MarecekPublished in: CoRR (2014)
Keyphrases
- integer programming
- general purpose
- packing problem
- np hard
- linear programming
- production planning
- special purpose
- constraint programming
- column generation
- cutting plane
- highly optimized
- cutting plane algorithm
- global constraints
- integer program
- lagrangian relaxation
- network flow
- transportation problem
- facility location
- set covering problem
- valid inequalities
- ai planning
- domain specific
- inference problems
- set covering
- vehicle routing problem with time windows
- set partitioning
- crew scheduling
- dantzig wolfe decomposition
- integer programming formulations
- genetic algorithm