A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primer in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-Many-to-One Single Vehicle Pickup and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single vehicle routing problem with deliveries and selective pickups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lasso solution strategies for the vehicle routing problem with pickups and deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for the Vehicle Routing Problem with Backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a vehicle-routing problem arising in soft-drink distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single‐vehicle routing problem with unrestricted backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problems with simultaneous pick-up and delivery service. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Vehicle Routing Problem with Backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532230 / rank
 
Normal rank

Latest revision as of 22:42, 2 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
scientific article

    Statements

    A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    0 references
    transportation
    0 references
    vehicle routing
    0 references
    deliveries and selective pickups
    0 references
    time windows
    0 references
    branch-and-price
    0 references
    shortest paths with resources
    0 references
    0 references
    0 references
    0 references