Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
From MaRDI portal
Publication:3564362
DOI10.1007/978-0-387-77778-8_14zbMATH Open1190.90283OpenAlexW91273403MaRDI QIDQ3564362FDOQ3564362
Authors: Artur Alves Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa 
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_14
Recommendations
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Integer Programming and Combinatorial Optimization
- Robust vehicle routing under uncertainty via branch-price-and-cut
- The robust vehicle routing problem with time windows: solution by branch and price and cut
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- Improved branch-cut-and-price for capacitated vehicle routing
- Improved branch-cut-and-price for capacitated vehicle routing
- A branch-and-cut algorithm for vehicle routing problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Stabilized column generation
- Branch-and-price: Column generation for solving huge integer programs
- Multistars, partial multistars and the capacitated vehicle routing problem
- Title not available (Why is that?)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- 2-path cuts for the vehicle routing problem with time windows
- Lot-sizing with start-up times
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Projection results for vehicle routing
- Path inequalities for the vehicle routing problem with time windows
- A column generation approach to the heterogeneous fleet vehicle routing problem
- The fleet size and mix vehicle routing problem
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Reachability cuts for the vehicle routing problem with time windows
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- Polyhedral study of the capacitated vehicle routing problem
- On a Generalization of the Master Cyclic Group Polyhedron
- Multimodal Express Package Delivery: A Service Network Design Application
- Integer Programming and Combinatorial Optimization
- A Polyhedral Intersection Theorem for Capacitated Spanning Trees
- Title not available (Why is that?)
Cited In (32)
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- Robust vehicle routing under uncertainty via branch-price-and-cut
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
- A matheuristic for the asymmetric capacitated vehicle routing problem
- The demand weighted vehicle routing problem
- The capacitated general windy routing problem with turn penalties
- Improved branch-cut-and-price for capacitated vehicle routing
- A hybrid algorithm for a class of vehicle routing problems
- A note on branch-and-cut-and-price
- Exact algorithms for routing problems under vehicle capacity constraints
- An ILP improvement procedure for the open vehicle routing problem
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Title not available (Why is that?)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Technical Note—The Complexity of the Pricing Problem of the Set Partitioning Formulation of Vehicle Routing Problems
- Title not available (Why is that?)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- The time dependent traveling salesman problem: polyhedra and algorithm
- Addressing orientation symmetry in the time window assignment vehicle routing problem
- Combined maintenance and routing optimization for large-scale sewage cleaning
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Exact solution of network flow models with strong relaxations
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- Title not available (Why is that?)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- The Vehicle Routing Problem with Release and Due Dates
- An exact column-generation approach for the lot-type design problem
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
Uses Software
This page was built for publication: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564362)
