Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem.
Mohd Shahrizan OthmanAleksandar ShurbevskiHiroshi NagamochiPublished in: IEICE Trans. Inf. Syst. (2018)
Keyphrases
- exact algorithms
- traveling salesman problem
- combinatorial optimization
- combinatorial problems
- combinatorial optimization problems
- benchmark instances
- optimization problems
- knapsack problem
- bipartite graph
- ant colony optimization
- approximation algorithms
- simulated annealing
- transportation networks
- vehicle routing problem
- traveling salesman
- hamiltonian cycle
- heuristic methods
- metaheuristic
- undirected graph
- branch and bound algorithm
- exact solution
- branch and bound
- valid inequalities
- genetic local search
- crossover operator
- quadratic assignment problem
- genetic algorithm
- memetic algorithm
- neural network