Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive

DOI10.1016/j.tcs.2018.06.006zbMath1411.90304OpenAlexW2806928313MaRDI QIDQ1786606

Alain Faye, Dimitri Watel

Publication date: 24 September 2018

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

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

zbMATH Keywords

dial-a-ride problemparameterized complexityapproximabilitytaxi-sharing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• The pickup and delivery problem with time windows
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
• The dial-a-ride problem: Models and algorithms
• Variable neighborhood search for the dial-a-ride problem
• Meta-Heuristics for a Class of Demand-Responsive Transit Systems
• Topological sorting of large networks
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• The General Pickup and Delivery Problem

This page was built for publication: Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive