Login / Signup
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem.
Nicolas Jozefowiez
Gilbert Laporte
Frédéric Semet
Published in:
INFORMS J. Comput. (2012)
Keyphrases
</>
traveling salesman problem
ant colony optimization
combinatorial optimization
optimization algorithm
learning algorithm
hamiltonian cycle
random walker
similarity measure
optimal solution
graph cuts
np hard
dynamic programming
state space
graph structure
traveling salesman