Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.
Luis Eduardo Neves GouveiaMarkus LeitnerMario RuthmairPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- traveling salesman problem
- optimization problems
- combinatorial optimization
- black and white
- combinatorial optimization problems
- combinatorial problems
- ant colony optimization
- computational complexity
- valid inequalities
- gray level
- optimization methods
- genetic algorithm
- evolutionary algorithm
- photoshop cs
- ant colony optimization algorithm
- particle swarm optimization
- simulated annealing
- lower bound
- high quality
- computer vision