Effective Algorithms for a Bounded Version of the Uncapacitated TPP (Q5850941): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for the travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved solutions for the traveling purchaser problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the traveling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach for the travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The biobjective travelling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the traveling purchaser problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic tabu search strategies for the traveling purchaser problem / rank
 
Normal rank

Latest revision as of 10:11, 2 July 2024

scientific article; zbMATH DE number 5660646
Language Label Description Also known as
English
Effective Algorithms for a Bounded Version of the Uncapacitated TPP
scientific article; zbMATH DE number 5660646

    Statements

    Effective Algorithms for a Bounded Version of the Uncapacitated TPP (English)
    0 references
    0 references
    0 references
    20 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references