Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for vehicle routing solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path and the shortest road through <i>n</i> points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Heuristics for Capacitated Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789326 / rank
 
Normal rank

Latest revision as of 17:34, 27 June 2024

scientific article; zbMATH DE number 5238096
Language Label Description Also known as
English
Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
scientific article; zbMATH DE number 5238096

    Statements

    Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2008
    0 references
    0 references
    Vehicle routing problem
    0 references
    heuristic
    0 references
    probabilistic analysis of algorithms
    0 references
    0 references
    0 references