Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4221472 / 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: 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: Branch-and-Price: Column Generation for Solving Huge Integer Programs / 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: 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: On a Generalization of the Master Cyclic Group Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized column generation / 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: Integer Programming and Combinatorial Optimization / 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: A Polyhedral Intersection Theorem for Capacitated Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience / 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: Path inequalities for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multimodal Express Package Delivery: A Service Network Design Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Path Cuts for the Vehicle Routing Problem with Time Windows / 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: Projection results for vehicle routing / 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: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-Sizing with Start-Up Times / 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 21:53, 2 July 2024

scientific article
Language Label Description Also known as
English
Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
scientific article

    Statements

    Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (English)
    0 references
    0 references
    0 references
    2 June 2010
    0 references
    0 references
    column generation
    0 references
    cutting plane algorithms
    0 references
    extended formulations
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references