Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
From MaRDI portal
Publication:666967
DOI10.1016/J.EJOR.2019.01.041zbMATH Open1430.90141OpenAlexW2799339823WikidataQ128515169 ScholiaQ128515169MaRDI QIDQ666967FDOQ666967
Authors: Christian Tilk, Michael Drexl, Stefan Irnich 
Publication date: 12 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1801.pdf
Recommendations
- Exact solution of the soft-clustered vehicle-routing problem
- A generic exact solver for vehicle routing and related problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Shortest Path Problems with Resource Constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- Benchmarking optimization software with performance profiles.
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch-and-cut algorithm for the capacitated profitable tour problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- The split delivery vehicle routing problem: A survey
- A column generation algorithm for the vehicle routing problem with soft time windows
- The vehicle routing problem. Latest advances and new challenges.
- Fleet assignment and routing with schedule synchronization constraints
- The vehicle routing problem with time windows and temporal dependencies
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
- Column Generation
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Resource extension functions: properties, inversion, and generalization to segments
- 2-path cuts for the vehicle routing problem with time windows
- New route relaxation and pricing strategies for the vehicle routing problem
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Vehicle Routing
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- A mixed-integer model for solving ordering problems with side constraints
- Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation
- Title not available (Why is that?)
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Arc routing problems with time-dependent service costs
- Efficient production-distribution system design
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Exact algorithms for electric vehicle-routing problems with time windows
- A method for solving ship routing problems with inventory constraints
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- Improved branch-cut-and-price for capacitated vehicle routing
- Dynamic graph generation for the shortest path problem in time expanded networks
- A nested column generation algorithm to the meta slab allocation problem in the steel making industry
- Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
Cited In (6)
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
- A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
Uses Software
This page was built for publication: Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666967)
