A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (Q2514736): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998559262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows / 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: Recent Models and Algorithms for One-to-One Pickup and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes for branch-and-price algorithms / 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: Solving a school bus scheduling problem with integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Makespan Multi-vehicle Dial-a-Ride / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Path Cuts for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two exact algorithms for the distance-constrained vehicle routing problem / 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: The dial-A-ride problem with transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pickup And Delivery Problem With Time Windows And Transshipment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time split-delivery pickup and delivery time window problems with transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing 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 approach for the pickup and delivery problem with shuttle routes
scientific article

    Statements

    A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 February 2015
    0 references
    0 references
    pickup and delivery problem
    0 references
    transfers
    0 references
    column generation
    0 references
    branch-and-cut-and-price
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references