Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / 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.2014.10.053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072304981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Swapping Problem on a Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution system planning through a generalized Benders decomposition approach / 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: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Capacitated Routing and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In Pursuit of the Traveling Salesman / 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: A Benders Decomposition Approach for the Locomotive and Car Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Assignment of Locomotives and Cars to Passenger Trains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Daily Aircraft Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combined Vehicle Routing and Inventory Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the traveling salesman problem with pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rich vehicle routing problems: from a taxonomy to a definition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunities for OR in intermodal freight transport research: A review. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-commodity vehicle routing problem with pickup and delivery service / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A truck scheduling problem arising in intermodal container transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of dynamic vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / 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: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one‐commodity pickup and delivery travelling salesman problem on a path or a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic-based truck scheduling for inland container transportation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:56, 12 July 2024

scientific article
Language Label Description Also known as
English
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
scientific article

    Statements

    Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2016
    0 references
    pickup and delivery problem
    0 references
    asymmetric traveling salesman problem
    0 references
    classical Benders decomposition
    0 references
    generalized Benders decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers