EFFECTIVE HEURISTIC ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM.

S. Lin; B. W. Kernighan

doi:10.1287/opre.21.2.498

EFFECTIVE HEURISTIC ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM.

S. Lin, B. W. Kernighan

Research output: Contribution to journal › Article › peer-review

2879 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 language	English (US)
Pages (from-to)	498-516
Number of pages	19
Journal	Operations Research
Volume	21
Issue number	2
DOIs	https://doi.org/10.1287/opre.21.2.498
State	Published - 1973

All Science Journal Classification (ASJC) codes

Computer Science Applications
Management Science and Operations Research

Access to Document

10.1287/opre.21.2.498

Cite this

@article{324153dc822b40df88fe8c92d52bad0e,

title = "EFFECTIVE HEURISTIC ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM.",

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.",

author = "S. Lin and Kernighan, \{B. W.\}",

year = "1973",

doi = "10.1287/opre.21.2.498",

language = "English (US)",

volume = "21",

pages = "498--516",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

number = "2",

}

TY - JOUR

T1 - EFFECTIVE HEURISTIC ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM.

AU - Lin, S.

AU - Kernighan, B. W.

PY - 1973

Y1 - 1973

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0015604699

UR - https://www.scopus.com/inward/citedby.url?scp=0015604699&partnerID=8YFLogxK

U2 - 10.1287/opre.21.2.498

DO - 10.1287/opre.21.2.498

M3 - Article

AN - SCOPUS:0015604699

SN - 0030-364X

VL - 21

SP - 498

EP - 516

JO - Operations Research

JF - Operations Research

IS - 2

ER -

EFFECTIVE HEURISTIC ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM.

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this