Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LKH / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986373227 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1902.10337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / 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: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / 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: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with exactly one hamiltonian circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank

Latest revision as of 03:30, 9 July 2024

scientific article
Language Label Description Also known as
English
Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem
scientific article

    Statements

    Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamiltonian cycle problem
    0 references
    Lin-Kernighan
    0 references
    heuristic
    0 references
    polynomial time
    0 references
    connected graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references