A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm.
Maksim BarketauHerbert KopferErwin PeschPublished in: J. Oper. Res. Soc. (2013)
Keyphrases
- branch and bound algorithm
- lower bound
- lagrangian relaxation
- optimal solution
- upper bound
- branch and bound
- lower bounding
- lower and upper bounds
- precedence constraints
- np hard
- randomly generated problems
- upper bounding
- single machine scheduling problem
- set covering problem
- mixed integer linear programming
- setup times
- quay crane
- container terminal
- combinatorial optimization
- network design problem
- objective function
- mixed integer programming
- variable ordering
- max sat
- branch and bound method
- worst case
- linear programming
- linear programming relaxation
- valid inequalities
- maximum clique