A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants.
Nicolas JozefowiezGilbert LaporteFrédéric SemetPublished in: Comput. Oper. Res. (2011)
Keyphrases
- hamiltonian cycle
- learning algorithm
- computational complexity
- dynamic programming
- cost function
- optimal solution
- search space
- np hard
- objective function
- evolutionary algorithm
- simulated annealing
- linear programming
- particle swarm optimization
- optimization algorithm
- genetic algorithm ga
- phase transition
- randomly generated