Exact and Compact Formulation of the Fixed-Destination Travelling Salesman Problem by Cycle Imposement Through Node Currents.
Mernout BurgerPublished in: OR (2013)
Keyphrases
- intermediate nodes
- source node
- directed graph
- quadratic assignment problem
- shortest path
- fixed number
- destination node
- genetic algorithm
- lp relaxation
- probabilistic model
- tree structure
- operating conditions
- brute force
- path length
- wireless networks
- random walk
- probabilistic formulation
- dynamic programming
- bayesian networks