An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules.
Bo JinShunji TanakaPublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- dominance rules
- lower bound
- branch and bound algorithm
- upper bound
- branch and bound
- np hard
- lower and upper bounds
- optimal solution
- max sat
- precedence constraints
- lagrangian relaxation
- column generation
- single machine scheduling problem
- objective function
- worst case
- exact algorithms
- evolutionary algorithm
- exact methods
- linear programming
- integer programming
- packing problem