Improved branch-cut-and-price for capacitated vehicle routing (Q2398107): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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: CVRPSEP / 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/s12532-016-0108-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2518529723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem / 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: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints / 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: Robust branch-and-cut-and-price for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / 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: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient elementary and restricted non-elementary route pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Branch-Cut-and-Price for Capacitated Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling 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: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming techniques for the nurse rostering problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:55, 14 July 2024

scientific article
Language Label Description Also known as
English
Improved branch-cut-and-price for capacitated vehicle routing
scientific article

    Statements

    Improved branch-cut-and-price for capacitated vehicle routing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 August 2017
    0 references
    integer programming
    0 references
    column generation
    0 references
    cut separation
    0 references
    algorithmic engineering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers