Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
From MaRDI portal
Publication:6090149
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A Dynamic Programming Approach to Sequencing Problems
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- A deterministic annealing local search for the electric autonomous dial-a-ride problem
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- A note on two problems in connexion with graphs
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- An Algorithm for the Traveling Salesman Problem
- An algorithm for the traveling salesman problem with pickup and delivery customers
- An exact algorithm for the pickup and delivery problem with time windows
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Event-based MILP models for ridepooling applications
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Reachability cuts for the vehicle routing problem with time windows
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Strong cuts from compatibility relations for the dial-a-ride problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The dial-a-ride problem with private fleet and common carrier
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- The truck dispatching problem
- Typology and literature review for dial-a-ride problems
This page was built for publication: Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090149)
