Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A man-machine approach toward solving 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: The traveling salesman problem: An update of research / 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: Q3996398 / rank
 
Normal rank

Revision as of 09:15, 21 June 2024

scientific article
Language Label Description Also known as
English
Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
scientific article

    Statements

    Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    search techniques
    0 references
    traveling salesman
    0 references
    simulated annealing
    0 references
    superlinear speedup
    0 references
    tabu search
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references