Deciding in HFS-Theory via Linear Integer Programming.
Mohamed HibtiHenri LombardiBruno LegeardPublished in: LPAR (1993)
Keyphrases
- integer programming
- np hard
- constraint programming
- set covering
- linear programming
- production planning
- ai planning
- facility location
- network flow
- lagrangian relaxation
- cutting plane
- column generation
- valid inequalities
- inference problems
- cutting plane algorithm
- transportation problem
- layout design
- round robin tournament
- set partitioning
- integer programming formulations
- crew scheduling
- dantzig wolfe decomposition
- learning algorithm
- linear programming relaxation
- set covering problem
- quadratic programming
- special case
- optimal solution
- objective function