On a cutting plane heuristic for the stable roommates problem and its applications.
Chung-Piaw TeoJay SethuramanPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- cutting plane
- integer programming
- cutting plane algorithm
- lower bound
- column generation
- mixed integer
- optimal solution
- mixed integer linear programming
- knapsack problem
- lagrangian relaxation
- simulated annealing
- tabu search
- integer program
- tree search
- valid inequalities
- mixed integer programming
- exact penalty
- constraint satisfaction
- dynamic programming
- exact algorithms
- learning algorithm
- feasible solution
- optimization problems
- branch and bound algorithm
- np hard
- search algorithm
- branch and bound