(Q57406544)

English

An effective implementation of the Lin–Kernighan traveling salesman heuristic

article published in 2000

In more languages

edit

Statements

instance of

scholarly article

0 references

title

An effective implementation of the Lin–Kernighan traveling salesman heuristic (English)

0 references

author name string

Keld Helsgaun

series ordinal

1

0 references

publication date

October 2000

0 references

published in

European Journal of Operational Research

0 references

volume

126

0 references

issue

1

0 references

page(s)

106-130

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

cites work

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Solution of large-scale symmetric travelling salesman problems

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Optimization of a 532-city symmetric traveling salesman problem by branch and cut

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

The Traveling-Salesman Problem and Minimum Spanning Trees

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

The traveling-salesman problem and minimum spanning trees: Part II

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Shortest Connection Networks And Some Generalizations

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Validation of subgradient optimization

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

An Analysis of Several Heuristics for the Traveling Salesman Problem

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

P-Complete Approximation Problems

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

TSPLIB—A Traveling Salesman Problem Library

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

The shortest path through many points

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Transforming asymmetric into symmetric traveling salesman problems

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

1 reference

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Some Examples of Difficult Traveling Salesman Problems

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0377-2217%2899%2900284-2

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Identifiers

DOI

10.1016/S0377-2217(99)00284-2

0 references

DBLP publication ID

journals/eor/Helsgaun00

1 reference

stated in

DBLP Dataset 2021-01-02

retrieved

28 January 2021

zbMATH Open document ID

0969.90073

0 references

(Q57406544)

An effective implementation of the Lin–Kernighan traveling salesman heuristic

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)