Back to Search
Start Over
On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
- Source :
- Operations Research. 7:58-66
- Publication Year :
- 1959
- Publisher :
- Institute for Operations Research and the Management Sciences (INFORMS), 1959.
-
Abstract
- This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear programming is used to reduce the combinatorial magnitude of such problems. To illustrate the method, a step-by-step solution of Barachet's ten-city example is presented.
- Subjects :
- Mathematical optimization
Quadratic assignment problem
Branch and price
Cross-entropy method
Combinatorial optimization
Criss-cross algorithm
Management Science and Operations Research
Bottleneck traveling salesman problem
Randomized rounding
Computer Science Applications
Mathematics
Linear-fractional programming
Subjects
Details
- ISSN :
- 15265463 and 0030364X
- Volume :
- 7
- Database :
- OpenAIRE
- Journal :
- Operations Research
- Accession number :
- edsair.doi...........d05e590fd33f05537b4e3d3f1b3d60ed