Abstract
Procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem is discussed. The procedure is believed to have wide applicability in combinatorial optimization problems.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 498-516 |
| Number of pages | 19 |
| Journal | Operations Research |
| Volume | 21 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1973 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'EFFECTIVE HEURISTIC ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver