A fast optimization method based on a hierarchical strategy for the travelling salesman problem (Q1330340): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / 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: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization methods for multimodal inverse problems / rank
 
Normal rank

Revision as of 15:57, 22 May 2024

scientific article
Language Label Description Also known as
English
A fast optimization method based on a hierarchical strategy for the travelling salesman problem
scientific article

    Statements

    A fast optimization method based on a hierarchical strategy for the travelling salesman problem (English)
    0 references
    0 references
    18 July 1994
    0 references
    hierarchical strategy
    0 references
    travelling salesman
    0 references
    hiearchical algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers