An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57406544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Large-scale Travelling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric traveling salesman problem and edge exchanges in minimal 1- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the symmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of step size in subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated branch exchange heuristics for symmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Heuristics for Large Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Significance of the Initial Solution in Travelling Salesman Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances between traveling salesman tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick updates for \(p\)-opt TSP heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for Traveling Salesmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Travelling-Salesman Problems with Known Optimal Tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming asymmetric into symmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Examples of Difficult Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Lin--Kernighan traveling-salesman heuristic / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00284-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017708378 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:32, 30 July 2024

scientific article
Language Label Description Also known as
English
An effective implementation of the Lin-Kernighan traveling salesman heuristic
scientific article

    Statements

    An effective implementation of the Lin-Kernighan traveling salesman heuristic (English)
    0 references
    0 references
    4 October 2001
    0 references
    traveling salesman problem
    0 references
    heuristics
    0 references
    Lin-Kernighan
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers