Satisfiability and integer programming as complementary tools.
Ruiming LiDian ZhouDonglei DuPublished in: ASP-DAC (2004)
Keyphrases
- integer programming
- np hard
- ai planning
- linear programming
- constraint programming
- production planning
- facility location
- cutting plane
- cutting plane algorithm
- set covering problem
- network flow
- lagrangian relaxation
- integer program
- set covering
- crew scheduling
- transportation problem
- integer programming formulations
- column generation
- valid inequalities
- satisfiability problem
- inference problems
- constraint satisfaction problems
- computational complexity
- linear programming relaxation
- lower bound
- optimal solution
- dantzig wolfe decomposition
- web services