The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2009.01.022 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017665166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / 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: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic vehicle routing problem with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2759919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very large-scale vehicle routing: new test problems, algorithms, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives / 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: An effective genetic algorithm approach to multiobjective routing problems (MORPs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem: Faces and branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drive: Dynamic Routing of Independent Vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2009.01.022 / rank
 
Normal rank

Latest revision as of 14:40, 10 December 2024

scientific article
Language Label Description Also known as
English
The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
scientific article

    Statements

    The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    pickup and delivery
    0 references
    dial-a-ride
    0 references
    branch-and-bound
    0 references
    branch-and-cut
    0 references
    Benders decomposition
    0 references
    mixed-integer programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers