Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems

Cites Work

A note on two problems in connexion with graphs
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
An algorithm for the traveling salesman problem with pickup and delivery customers
Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
Solving a selective dial-a-ride problem with logic-based Benders decomposition
Typology and literature review for dial-a-ride problems
The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
Strong cuts from compatibility relations for the dial-a-ride problem
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
Event-based MILP models for ridepooling applications
Reachability cuts for the vehicle routing problem with time windows
A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
The dial-a-ride problem with private fleet and common carrier
The Truck Dispatching Problem
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Dynamic Programming Treatment of the Travelling Salesman Problem
A Dynamic Programming Approach to Sequencing Problems
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Solution of a Large-Scale Traveling-Salesman Problem
An Algorithm for the Traveling Salesman Problem
A deterministic annealing local search for the electric autonomous dial-a-ride problem

This page was built for publication: Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems