The stop number minimization problem: complexity and polyhedral analysis

DOI10.1007/978-3-319-96151-4_6MaRDI QIDQ1661860zbMATH OpenOpenAlexFDO

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

Publication date 17 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96151-4_6

zbMATH Keywords

autonomous vehiclesbranch-and-cutcomplexity

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The pickup and delivery problem: Faces and branch-and-cut algorithm
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• An effective and fast heuristic for the dial-a-ride problem
• Strong cuts from compatibility relations for the dial-a-ride problem
• On the vehicle routing problem

Cited in

(4)

• Finding minimum stopping and trapping sets: an integer linear programming approach
• The complexity of the unit stop number problem and its implications to other related problems
• Pickup and delivery problems with autonomous vehicles on rings
• Branch and price algorithm for the stop number minimization problem

This page was built for publication: The stop number minimization problem: complexity and polyhedral analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661860)