Data structures and ejection chains for solving large-scale traveling salesman problems (Q1887873): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56017139, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A data structure useful for finding Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for Traveling Salesmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation analysis of efficient heuristic algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / 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: Relaxed tours and path ejections for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank

Revision as of 14:36, 7 June 2024

scientific article
Language Label Description Also known as
English
Data structures and ejection chains for solving large-scale traveling salesman problems
scientific article

    Statements

    Data structures and ejection chains for solving large-scale traveling salesman problems (English)
    0 references
    0 references
    0 references
    0 references
    22 November 2004
    0 references
    Traveling salesman
    0 references
    Local search
    0 references
    Data structures
    0 references
    Ejection chains
    0 references
    0 references
    0 references

    Identifiers