Quality of LP-Based Approximations for Highly Combinatorial Problems.
Lucian LeahuCarla P. GomesPublished in: CP (2004)
Keyphrases
- combinatorial problems
- constraint programming
- constraint satisfaction
- graph coloring
- constraint satisfaction problems
- phase transition
- traveling salesman problem
- combinatorial optimization
- metaheuristic
- global constraints
- linear programming
- branch and bound algorithm
- combinatorial search
- solving hard
- hard combinatorial optimization problems
- constraint propagation
- graph colouring
- np hard
- specific problems
- satisfiability problem
- integer programming
- linear program
- load balancing
- np complete
- symmetry breaking
- evolutionary algorithm
- lower bound
- search algorithm
- genetic algorithm