The complexity of the unit stop number problem and its implications to other related problems

DOI10.1016/j.tcs.2022.03.027OpenAlexW3126639776MaRDI QIDQ2136280

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

Publication date: 10 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.027

zbMATH Keywords

computational complexitycombinatorial optimizationdial-a-ridetraffic groomingstop number problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

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

Cites Work

• An optimization framework for the development of efficient one-way car-sharing systems
• Hardness and approximation of traffic grooming
• On the complexity of partitioning graphs into connected subgraphs
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
• Optimization for dynamic ride-sharing: a review
• Traffic grooming on the path
• The dial-a-ride problem: Models and algorithms
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Planar 3DM is NP-complete
• Reducibility among Combinatorial Problems
• Fleet management for autonomous vehicles: Online PDP under special constraints