Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

Horváth, Markó and Kis, Tamás (2018) Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, xx. pp. 1-29. ISSN 1435-246X 10.1007/s10100-017-0489-4

[img] Text
Horvath_1_3305817_ny.pdf

Download (399kB)
[img] Text
Horvath_1_3305817_z.pdf
Restricted to Registered users only

Download (497kB) | Request a copy
Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Research Laboratory on Engineering & Management Intelligence
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 09 Jan 2019 12:54
Last Modified: 09 Jan 2019 12:54
URI: http://eprints.sztaki.hu/id/eprint/9605

Update Item Update Item