The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph.
Egon BalasPublished in: SIAM J. Discret. Math. (1989)
Keyphrases
- directed graph
- traveling salesman
- random walk
- traveling salesman problem
- facet defining inequalities
- directed acyclic graph
- quadratic assignment problem
- graph structure
- maximum flow
- np hard
- global optimization
- shortest path problem
- neural network
- genetic algorithm
- machine learning
- lower bound
- sensor networks
- computational complexity
- decision trees
- strongly connected