On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling
Edmund K. BurkeJakub MarecekAndrew J. ParkesHana RudováPublished in: CoRR (2007)
Keyphrases
- integer programming formulation
- randomly generated
- randomly generated problems
- linear programming relaxation
- valid inequalities
- constraint satisfaction
- tabu search algorithm
- lp relaxation
- branch and bound algorithm
- integer programming
- np complete
- knapsack problem
- boolean functions
- lower bound
- traveling salesman problem
- linear program
- maximum likelihood
- linear programming
- optimization problems
- simulated annealing