A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances

Research output: Scientific - peer-reviewArticle

Standard

A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances. / Hame, Lauri; Hakula, Harri.

In: TRANSPORTATION SCIENCE, Vol. 49, No. 2, 2015, p. 295-310.

Research output: Scientific - peer-reviewArticle

Harvard

APA

Vancouver

Author

Hame, Lauri; Hakula, Harri / A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances.

In: TRANSPORTATION SCIENCE, Vol. 49, No. 2, 2015, p. 295-310.

Research output: Scientific - peer-reviewArticle

Bibtex - Download

@article{41ee01e1222d4a46bc3e04db6b69c698,
title = "A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances",
author = "Lauri Hame and Harri Hakula",
year = "2015",
doi = "10.1287/trsc.2013.0495",
volume = "49",
pages = "295--310",
journal = "TRANSPORTATION SCIENCE",
issn = "0041-1655",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

RIS - Download

TY - JOUR

T1 - A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances

AU - Hame,Lauri

AU - Hakula,Harri

PY - 2015

Y1 - 2015

UR - http://pubsonline.informs.org/doi/pdf/10.1287/trsc.2013.0495

U2 - 10.1287/trsc.2013.0495

DO - 10.1287/trsc.2013.0495

M3 - Article

VL - 49

SP - 295

EP - 310

JO - TRANSPORTATION SCIENCE

T2 - TRANSPORTATION SCIENCE

JF - TRANSPORTATION SCIENCE

SN - 0041-1655

IS - 2

ER -

ID: 1996310