An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / 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.1007/s10107-007-0178-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082153300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for solving capacitated location problems based on a set partitioning approach / 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: Q4834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5447023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / 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: An Additive Bounding Procedure for Combinatorial Optimization Problems / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent method with linear programming subproblems for nondifferentiable convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem: An overview of exact and approximate algorithms / 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: Q4532227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistars, partial multistars and the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / 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 B<scp>oxstep</scp> Method for Large-Scale Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set Partitioning Approach to the Crew Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for the Vehicle Routing Problem with Backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point stabilization for column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank

Latest revision as of 17:19, 28 June 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
scientific article

    Statements

    An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2008
    0 references
    vehicle routing
    0 references
    set partitioning
    0 references
    dual ascent
    0 references
    valid inequalities
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers