Complexity, algorithmic, and computational aspects of a dial-a-ride type problem

DOI10.1016/j.ejor.2023.03.018OpenAlexW4221143922MaRDI QIDQ6113356

Hervé L. M. Kerivin, Rafael Colares, Mourad Baïou

Publication date: 11 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.03.018

zbMATH Keywords

computational complexitycombinatorial optimizationdial-a-ridepolyhedral studyautonomous vehicles

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Orbitopal fixing
• Chain packing in graphs
• Packing and partitioning orbitopes
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
• The complexity of the unit stop number problem and its implications to other related problems
• The dial-a-ride problem: Models and algorithms
• Edmonds polytopes and a hierarchy of combinatorial problems
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• Improving Discrete Model Representations via Symmetry Considerations
• Outline of an algorithm for integer solutions to linear programs
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Symmetry in Integer Linear Programming
• Planar 3DM is NP-complete
• Weighted k‐cardinality trees: Complexity and polyhedral structure
• The SONET edge‐partition problem
• Spanning Trees—Short or Small
• Reducibility among Combinatorial Problems
• Exploiting Erraticism in Search
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows

This page was built for publication: Complexity, algorithmic, and computational aspects of a dial-a-ride type problem