Carpooling : the 2 Synchronization Points Shortest Paths Problem

DOI10.4230/OASIcs.ATMOS.2013.150zbMath1281.90014OpenAlexW2230027874MaRDI QIDQ5397853

Arthur Bit-Monnot, Marc-Olivier Killijian, Christian Artigues, Marie-José Huguet

Publication date: 24 February 2014

Full work available at URL: https://hal.science/hal-00843628

zbMATH Keywords

shortest path problemdynamic carpoolingsynchronized paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Related Items (3)

Real-Time Ride-Sharing Substitution Service in Multi-modal Public Transport Using Buckets ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ Modeling and solving the multimodal car- and ride-sharing problem

This page was built for publication: Carpooling : the 2 Synchronization Points Shortest Paths Problem