ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
20
views
0
references
Top references
cited by
173
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,139
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
An effective implementation of the Lin–Kernighan traveling salesman heuristic
Author(s):
Keld Helsgaun
Publication date
Created:
October 2000
Publication date
(Print):
October 2000
Journal:
European Journal of Operational Research
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
Further versions
oa repository (via OAI-PMH doi match)
Powered by
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and article information
Journal
Title:
European Journal of Operational Research
Abbreviated Title:
European Journal of Operational Research
Publisher:
Elsevier BV
ISSN (Print):
03772217
Publication date Created:
October 2000
Publication date (Print):
October 2000
Volume
: 126
Issue
: 1
Pages
: 106-130
Article
DOI:
10.1016/S0377-2217(99)00284-2
SO-VID:
43a82f20-0106-4e70-bccc-bc2f76e4026a
Copyright ©
© 2000
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
3,139
An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems
Authors:
Helsgaun
Solving the clustered traveling salesman problem using the Lin–Kernighan–Helsgaun algorithm
Authors:
K Helsgaun
The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
Authors:
Christos Papadimitriou
See all similar
Cited by
170
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Authors:
Javier Alonso-Mora
,
Samitha Samaranayake
,
Alex Wallar
…
Mathematical foundation of quantum annealing
Authors:
Satoshi Morita
,
Hidetoshi Nishimori
Chained Lin-Kernighan for Large Traveling Salesman Problems
Authors:
David Applegate
,
William Cook
,
André Rohe
See all cited by