Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees.
Michael J. DinneenMasoud KhosravaniPublished in: CATS (2011)
Keyphrases
- integer programming
- np hard
- approximation algorithms
- linear programming
- production planning
- column generation
- np complete
- computational complexity
- decision trees
- set covering problem
- inference problems
- lagrangian relaxation
- cutting plane
- constraint programming
- ai planning
- worst case
- linear programming relaxation
- lower bound
- valid inequalities
- integer programming formulations
- facility location
- integer program
- search strategies
- crew scheduling
- upper bound
- knapsack problem
- set covering
- feasible solution
- cutting plane algorithm
- linear program