Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
Year of publication: |
Januar 2019
|
---|---|
Authors: | Horváth, Markó ; Kis, Tamás |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 27.2019, 1, p. 39-67
|
Subject: | Vehicle and crew scheduling | Brand-and-price | Exact methods | Integer programming | Theorie | Theory | Personaleinsatzplanung | Crew scheduling | Tourenplanung | Vehicle routing problem | Operations Research | Operations research | Ganzzahlige Optimierung |
-
Improving set partitioning problem solutions by zooming around an improving direction
Zaghrouti, Abdelouahab, (2020)
-
Integrating timetabling and crew scheduling at a freight railway operator
Bach, Lukas, (2014)
-
Integrating timetabling and crew scheduling at a freigh railway operator
Bach, Lukas, (2016)
- More ...
-
Assembly planning by disjunctive programming and geometrical reasoning
Horváth, Markó, (2022)
-
Solving resource constrained shortest path problems with LP-based methods
Horváth, Markó, (2016)
-
Polyhedral results for position-based scheduling of chains on a single machine
Horváth, Markó, (2020)
- More ...