A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems.
Manfred PadbergGiovanni RinaldiPublished in: SIAM Rev. (1991)
Keyphrases
- dynamic programming
- computational complexity
- cost function
- traveling salesman problem
- hamiltonian cycle
- search space
- neural network
- reinforcement learning
- np hard
- distance metric
- combinatorial optimization
- expectation maximization
- segmentation algorithm
- optimization algorithm
- knapsack problem
- particle swarm optimization algorithm