Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Routing a Heterogeneous Fleet of Vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified exact method for solving different classes of vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to the heterogeneous fleet vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dual-feasible and superadditive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral study of the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined route capacity and route length models for unit demand vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on projection for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thirty years of heterogeneous vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Routing under Capacity and Distance Restrictions / 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: Projection results for vehicle routing / 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: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and valid inequalities for the heterogeneous vehicle routing problem / rank
 
Normal rank

Latest revision as of 02:42, 15 July 2024

scientific article
Language Label Description Also known as
English
Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
scientific article

    Statements

    Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (English)
    0 references
    0 references
    0 references
    6 February 2018
    0 references
    transportation
    0 references
    capacitated vehicle routing problem
    0 references
    reformulation-linearization technique
    0 references
    heterogeneous VRP
    0 references
    compact formulations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers