Pickup and delivery problem with incompatibility constraints
From MaRDI portal
Publication:2333153
Recommendations
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Recent models and algorithms for one-to-one pickup and delivery problems
Cites work
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
- An exact algorithm for parallel machine scheduling with conflicts
- Heuristics and lower bounds for the bin packing problem with conflicts
- Heuristics for the multi-depot petrol station replenishment problem with time windows
- New methods to color the vertices of a graph
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Recent models and algorithms for one-to-one pickup and delivery problems
- Routing problems with loading constraints
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Solving transportation problems with nonlinear side constraints with tabu search
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- The dial-a-ride problem: Models and algorithms
- The directed profitable rural postman problem with incompatibility constraints
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- The Red-Blue transportation problem
- The transportation problem with exclusionary side constraints
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- The traveling salesman problem. A computational study.
- Transportation problem with nonlinear side constraints a branch and bound approach
- Typology and literature review for dial-a-ride problems
Cited in
(8)- Mathematical models for a ship routing problem with a small number of ports on a route
- Fair allocation of indivisible items with conflict graphs
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
- The General Pickup and Delivery Problem
- The family traveling salesman problem with incompatibility constraints
- Learning-based column generation approach for the vehicle routing problem with release dates and incompatible loading constraints
- An exact branch-price-and-cut algorithm for the time-dependent cold chain pickup and delivery problem with incompatibility constraints
This page was built for publication: Pickup and delivery problem with incompatibility constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333153)
