EFFECTIVE HEURISTIC ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM.

Research output: Contribution to journalArticle

2213 Scopus citations

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 languageEnglish (US)
Pages (from-to)498-516
Number of pages19
JournalOperations Research
Volume21
Issue number2
DOIs
StatePublished - Jan 1 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