Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
type: Item
instance of: scholarly article
title: Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
zbMATH Open document ID: 1411.90304
author: Dimitri Watel
author: Alain Faye
published in: Theoretical Computer Science
publication date: 2018-09-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6942979
zbMATH Keywords: parameterized complexity
zbMATH Keywords: approximability
zbMATH Keywords: dial-a-ride problem
zbMATH Keywords: taxi-sharing
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.06.006
OpenAlex ID: W2806928313
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The dial-a-ride problem: Models and algorithms
cites work: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
cites work: Meta-heuristics for a class of demand-responsive transit systems
cites work: The pickup and delivery problem with time windows
cites work: Q4198056
cites work: Topological sorting of large networks
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Variable neighborhood search for the dial-a-ride problem
cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
cites work: Q4395334
cites work: The General Pickup and Delivery Problem
DOI: 10.1016/J.TCS.2018.06.006
description: scientific article; zbMATH DE number 6942979