Polynomially solvable cases of the bipartite traveling salesman problem.
Alfredo García OlaverriJavier TejelPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- traveling salesman problem
- polynomially solvable
- combinatorial optimization
- ant colony optimization
- optimization problems
- special case
- np complete
- ant colony optimization algorithm
- processing times
- discrete optimization problems
- traveling salesman
- combinatorial problems
- valid inequalities
- hamiltonian cycle
- combinatorial optimization problems
- vehicle routing problem
- discrete particle swarm optimization
- graph model
- minimum cost
- np hard
- bipartite graph
- approximation algorithms
- variable neighborhood search
- neural network