The traveling salesman problem: An update of research
- 1 March 1983
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 30 (1) , 69-96
- https://doi.org/10.1002/nav.3800300107
Abstract
No abstract availableKeywords
This publication has 57 references indexed in Scilit:
- An algorithm to solve the m × n assignment problem in expected time O(mn log n)Networks, 1980
- Deterministic network optimization: A bibliographyNetworks, 1977
- Some recent results in hamiltonian graphsJournal of Graph Theory, 1977
- On the complexity of edge traversingJournal of the ACM, 1976
- A man-machine approach toward solving the traveling salesman problemCommunications of the ACM, 1971
- Hamiltonian circuits in graphs and digraphsPublished by Springer Nature ,1969
- Spanning tree manipulation and the travelling salesman problemThe Computer Journal, 1968
- Systematic generation of Hamiltonian circuitsCommunications of the ACM, 1966
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Note on Hamilton CircuitsThe American Mathematical Monthly, 1960