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

Markó Horváth, Tamás Kis

Research output: Contribution to journalArticle

3 Citations (Scopus)

Fingerprint Dive into the research topics of 'Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price'. Together they form a unique fingerprint.

Business & Economics