A Hard Dial-a-Ride Problem that is Easy on Average

Author： Coja-Oghlan Amin   Krumke Sven   Nierhoff Till  

Publisher： Springer Publishing Company

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.8, Iss.3, 2005-06, pp. : 197-210

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The dial-a-ride problem: models and algorithms

By Cordeau Jean-François  

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 29-46

Springer Publishing Company

Access to resources Recommend Favorite

On-line single-server dial-a-ride problems

By Feuerstein  

Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. : 91-105

Elsevier

Access to resources Recommend Favorite

On-Line Dial-a-Ride Problems Under a Restricted Information Model

By Lipmann Maarten   Lu Xiwen   Paepe Willem E.   Sitters Rene A.   Stougie Leen  

Algorithmica, Vol. 40, Iss. 4, 2004-09 ,pp. : 319-329

Springer Publishing Company

Access to resources Recommend Favorite

Easy As

By York Gary  

ITNOW, Vol. 55, Iss. 2, 2013-06 ,pp. : 36-37

Oxford University Press

Access to resources Recommend Favorite

A hard clustering approach to the part family formation problem

By Al-Sultan K. S.  

Production Planning and Control, Vol. 8, Iss. 3, 1997-04 ,pp. : 231-236

Taylor & Francis Ltd

Access to resources Recommend Favorite