Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2017.0747 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to linear programming problems / 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: Local cuts for mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / 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: Numerically Safe Gomory Mixed-Integer Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Rational Mixed-Integer Programming Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid branch-and-bound approach for exact rational mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the safety of Gomory cut generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / 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: Maximum-weight stable sets and safe lower bounds for graph coloring / 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: Multistars, partial multistars and the capacitated vehicle routing problem / 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: Safe bounds in linear and mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Branch-Cut-and-Price for Capacitated Vehicle Routing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2017.0747 / rank
 
Normal rank

Latest revision as of 14:47, 30 December 2024

scientific article; zbMATH DE number 6821369
Language Label Description Also known as
English
Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem
scientific article; zbMATH DE number 6821369

    Statements

    Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (English)
    0 references
    0 references
    0 references
    29 December 2017
    0 references
    computational methods
    0 references
    dynamic programming
    0 references
    integer programming
    0 references
    column generation
    0 references
    branch and price
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references