Iterative patching and the asymmetric traveling salesman problem (Q2494813): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A new memetic algorithm for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of large-scale, asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding branch and bound within evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction heuristics for the asymmetric TSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Hungarian assignment algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gentle Introduction to Memetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715669 / rank
 
Normal rank

Revision as of 17:51, 24 June 2024

scientific article
Language Label Description Also known as
English
Iterative patching and the asymmetric traveling salesman problem
scientific article

    Statements

    Iterative patching and the asymmetric traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    asymmetric traveling salesman problem
    0 references
    branch-and-bound
    0 references
    upper bounding
    0 references
    patching
    0 references

    Identifiers