The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
- 1 November 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 2 (4) , 425-451
- https://doi.org/10.1137/0402038
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Clique Tree Inequalities and the Symmetric Travelling Salesman ProblemMathematics of Operations Research, 1986
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facetsDiscrete Mathematics, 1981
- On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facetsPublished by Springer Nature ,1981
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Nature ,1980
- On the symmetric travelling salesman problem II: Lifting theorems and facetsMathematical Programming, 1979
- On the facial structure of set packing polyhedraMathematical Programming, 1973
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954