Lineare Charakterisierungen von Travelling Salesman Problemen
- 1 February 1977
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 21 (1) , 33-64
- https://doi.org/10.1007/bf01918456
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Facet of regular 0–1 polytopesMathematical Programming, 1975
- Facets of the knapsack polytopeMathematical Programming, 1975
- On the Set-Covering Problem: II. An Algorithm for Set PartitioningOperations Research, 1975
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problemMathematical Programming, 1974
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973
- On the Set-Covering ProblemOperations Research, 1972
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965