Relaxed tours and path ejections for the traveling salesman problem (Q1609913): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 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: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Clustering Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers and packings in a family of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move / 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: 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: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the multilevel generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem: An overview of exact and approximate algorithms / 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: A modified Lin--Kernighan traveling-salesman heuristic / 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: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / 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: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:59, 4 June 2024

scientific article
Language Label Description Also known as
English
Relaxed tours and path ejections for the traveling salesman problem
scientific article

    Statements

    Relaxed tours and path ejections for the traveling salesman problem (English)
    0 references
    0 references
    18 August 2002
    0 references
    0 references
    traveling salesman problem
    0 references
    tabu search
    0 references
    ejection chains
    0 references
    0 references
    0 references
    0 references