Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792): 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: CPLEX / 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.dam.2021.12.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4200607477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted and local reachability cuts for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The precedence-constrained asymmetric traveling salesman polytope / 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 Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact algorithm for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pickup and delivery problem with time windows: a new compact two-index formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Linear Programming in the Oil Industry / 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: Finding Descriptions of Polytopes via Extended Formulations and Liftings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability cuts for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows / 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 Vehicle Routing Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:51, 27 July 2024

scientific article
Language Label Description Also known as
English
Strong cuts from compatibility relations for the dial-a-ride problem
scientific article

    Statements

    Strong cuts from compatibility relations for the dial-a-ride problem (English)
    0 references
    0 references
    0 references
    13 January 2022
    0 references
    pickup and delivery problem
    0 references
    cutting planes
    0 references
    exact separation
    0 references
    edge-polytope
    0 references
    0 references
    0 references

    Identifiers