A pattern generation-integer programming based formulation for the carpet loading problem.
Mert C. DemirPublished in: Comput. Ind. Eng. (2008)
Keyphrases
- integer programming
- pattern generation
- valid inequalities
- set partitioning
- integer program
- cutting plane algorithm
- dantzig wolfe decomposition
- linear programming relaxation
- integer programming formulations
- linear programming
- cutting plane
- column generation
- lp relaxation
- production planning
- np hard
- constraint programming
- network flow
- inference problems
- set covering
- transportation problem
- lagrangian relaxation
- facility location
- swarm robots
- ai planning
- network design problem
- cellular automaton
- set covering problem
- vehicle routing problem with time windows
- computer graphics
- reinforcement learning