Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
Open Access
- 1 January 1981
- journal article
- Published by EDP Sciences in Rairo-Operations Research
- Vol. 15 (3) , 233-239
- https://doi.org/10.1051/ro/1981150302331
Abstract
RO : RAIRO - Operations Research, an international journal on operations research, exploring high level pure and applied aspectsKeywords
This publication has 6 references indexed in Scilit:
- Using cutting planes to solve the symmetric Travelling Salesman problemMathematical Programming, 1978
- Integer programming approaches to the travelling salesman problemMathematical Programming, 1976
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- On the Relation Between the Traveling-Salesman and the Longest-Path ProblemsOperations Research, 1962
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954