Login / Signup

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

Markó HorváthTamás Kis
Published in: Central Eur. J. Oper. Res. (2019)
Keyphrases
  • lower and upper bounds
  • lower bound
  • upper bound
  • lagrangian relaxation
  • pedestrian detection
  • real world
  • lower bounding
  • linear programming
  • branch and bound algorithm
  • integer programming