Exact algorithms for the Equitable Traveling Salesman Problem.
Joris KinableBart SmeuldersEline DelcourFrits C. R. SpieksmaPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- traveling salesman problem
- exact algorithms
- combinatorial optimization
- combinatorial problems
- combinatorial optimization problems
- benchmark instances
- optimization problems
- knapsack problem
- ant colony optimization
- approximation algorithms
- metaheuristic
- transportation networks
- simulated annealing
- exact solution
- discrete optimization
- valid inequalities
- hamiltonian cycle
- genetic local search
- crossover operator
- vehicle routing problem
- max sat
- branch and bound
- branch and bound algorithm
- tabu search
- cost function
- discrete optimization problems
- job shop scheduling problem
- heuristic methods
- upper bound
- quadratic assignment problem
- evolutionary algorithm
- traveling salesman
- subtour elimination
- computational complexity