A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732): 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: Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / 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: Q4656643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the traveling repairman problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem / 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: Special issue on: Rich vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the \(k\)-traveling repairman problem with repair times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy Minimizing Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase metaheuristic for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for minimizing total latency in machine scheduling with deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with deliveries to multiple customer locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective memetic algorithm for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective metaheuristic for the minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the minimum latency problem / rank
 
Normal rank

Latest revision as of 16:09, 9 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
scientific article

    Statements

    A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (English)
    0 references
    0 references
    0 references
    3 February 2015
    0 references
    0 references
    routing
    0 references
    minimum latency
    0 references
    CCVRP
    0 references
    branch-and-cut-and-price
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references