An Integer Programming Approach to the Irregular Polyomino Tiling Problem.
Vadim M. KartakAigul FabarisovaPublished in: MOTOR (2) (2019)
Keyphrases
- integer programming
- np hard
- linear programming
- column generation
- ai planning
- constraint programming
- network flow
- lagrangian relaxation
- production planning
- cutting plane
- set covering problem
- integer program
- crew scheduling
- dantzig wolfe decomposition
- cutting plane algorithm
- vehicle routing problem with time windows
- facility location
- transportation problem
- valid inequalities
- network design problem
- inference problems
- set covering
- linear programming relaxation
- layout design
- simulated annealing
- search algorithm