Exact algorithms for the Hamiltonian cycle problem in planar graphs.
Vladimir G. DeinekoBettina KlinzGerhard J. WoegingerPublished in: Oper. Res. Lett. (2006)
Keyphrases
- exact algorithms
- hamiltonian cycle
- planar graphs
- traveling salesman problem
- combinatorial problems
- graph coloring
- combinatorial optimization
- max sat
- phase transition
- knapsack problem
- combinatorial optimization problems
- approximation algorithms
- exact solution
- optimization problems
- heuristic methods
- constraint satisfaction
- undirected graph
- lower bound
- ant colony optimization
- constraint satisfaction problems
- branch and bound algorithm
- approximate inference
- constraint programming
- tabu search
- metaheuristic
- belief propagation
- simulated annealing
- worst case
- dynamic programming