The dial-a-ride problem: models and algorithms

ISSN： 0254-5330

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

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

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

By Coja-Oghlan Amin Krumke Sven Nierhoff Till

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

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

The total adjustment cost problem: Applications, models, and solution algorithms

By Kreter Stefan Rieck Julia Zimmermann Jürgen

Journal of Scheduling, Vol. 17, Iss. 2, 2014-04 ,pp. : 145-160

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for the Set Covering Problem

By Caprara A.

Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. : 353-371

Springer Publishing Company

Access to resources Recommend Favorite