Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

Robert S. Garfinkel
Additional contact information
Robert S. Garfinkel: The University of Rochester, Rochester, New York

Operations Research, 1973, vol. 21, issue 1, 340-343

Abstract: This note develops a branching scheme for a branch-and-bound algorithm for the traveling-salesman problem. It improves on the algorithm of Bellmore and Malone in that a partition of the feasible set is achieved at every vertex of the enumeration tree.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.340 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:21:y:1973:i:1:p:340-343

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().