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

Research output: Contribution to journal › Article › Scientific › peer-review

21 Citations (Scopus)

Access to Document

@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",

language = "English",

volume = "49",

pages = "295--310",

journal = "Transportation Science",

issn = "0041-1655",

publisher = "Institute for Operations Research and the Management Sciences (INFORMS)",

number = "2",

}

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

SN - 0041-1655

VL - 49

SP - 295

EP - 310

JO - Transportation Science

JF - Transportation Science

IS - 2

ER -