A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solution of a Min-Max Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for minimum and min-max vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating capacity constraints in the CVRP using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5324200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to the heterogeneous fleet vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Traveling Salesman Problem with Minmax Objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing problems: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweep-based algorithm for the fleet size and mix vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic column generation method for the heterogeneous fleet VRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for min-max path cover problems in vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-based pheromone approach for the ant system / rank
 
Normal rank

Latest revision as of 23:42, 6 July 2024

scientific article
Language Label Description Also known as
English
A min-max vehicle routing problem with split delivery and heterogeneous demand
scientific article

    Statements

    A min-max vehicle routing problem with split delivery and heterogeneous demand (English)
    0 references
    0 references
    0 references
    1 November 2013
    0 references
    min-max vehicle routing
    0 references
    split delivery
    0 references
    heterogeneous demand
    0 references
    optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers