An integer programming approach to a class of combinatorial problems.
E. M. L. BealeJohn A. TomlinPublished in: Math. Program. (1972)
Keyphrases
- integer programming
- constraint programming
- combinatorial problems
- constraint satisfaction problems
- constraint satisfaction
- global constraints
- ai planning
- cutting plane
- constraint propagation
- graph coloring
- lagrangian relaxation
- column generation
- arc consistency
- solving hard
- production planning
- network flow
- exact algorithms
- search strategies
- combinatorial search
- linear programming
- cutting plane algorithm
- integer program
- traveling salesman problem
- combinatorial optimization
- set covering
- finite domain
- graph colouring
- propositional satisfiability
- valid inequalities
- np hard
- heuristic search
- upper bound
- dynamic programming
- objective function