Branch and price algorithm for the stop number minimization problem
From MaRDI portal
Cites work
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A generic exact solver for vehicle routing and related problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Improved branch-cut-and-price for capacitated vehicle routing
- Limited memory rank-1 cuts for vehicle routing problems
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- New route relaxation and pricing strategies for the vehicle routing problem
- Pickup and delivery problems with autonomous vehicles on rings
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Record breaking optimization results using the ruin and recreate principle
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Shortest Path Problems with Resource Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The stop number minimization problem: complexity and polyhedral analysis
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
This page was built for publication: Branch and price algorithm for the stop number minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7347867)
