New exponential neighbourhood for polynomially solvable TSPs.
Vladimir G. DeinekoPublished in: Electron. Notes Discret. Math. (2004)
Keyphrases
- polynomially solvable
- np complete
- np hard
- special case
- processing times
- makespan minimization
- minimum cost
- feasible solution
- traveling salesman problem
- optimal solution
- scheduling problem
- exponential size
- single machine
- linear programming
- branch and bound algorithm
- genetic algorithm
- upper bound
- lower bound
- reinforcement learning
- mathematical model
- simulated annealing
- approximation algorithms
- dynamic programming
- computational complexity
- artificial intelligence