Ejection chains, reference structures and alternating path methods for traveling salesman problems (Q1917273): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5596091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of augmenting chains in chain packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel tabu search algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5608582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / 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: Q4136942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / 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: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem / rank
 
Normal rank

Latest revision as of 13:08, 24 May 2024

scientific article
Language Label Description Also known as
English
Ejection chains, reference structures and alternating path methods for traveling salesman problems
scientific article

    Statements

    Ejection chains, reference structures and alternating path methods for traveling salesman problems (English)
    0 references
    0 references
    3 October 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman
    0 references
    neighbourhood search
    0 references
    ejection chain procedures
    0 references