Lower bound on size of branch-and-bound trees for solving lot-sizing problem.
Santanu S. DeyPrachi ShahPublished in: Oper. Res. Lett. (2022)
Keyphrases
- branch and bound
- lot sizing
- lower bound
- branch and bound algorithm
- upper bound
- integer programming problems
- combinatorial optimization
- mixed integer program
- branch and bound search
- single item
- multistage
- rolling horizon
- multi item
- branch and bound method
- column generation
- mixed integer programming
- search algorithm
- optimal solution
- cutting stock
- mixed integer
- tree search
- setup times
- randomly generated problems
- beam search
- lagrangian relaxation
- bnb adopt
- branch and bound procedure
- production planning
- lower and upper bounds
- np hard
- worst case
- search space
- cutting plane
- objective function
- previously solved
- lot size
- network design problem
- linear programming relaxation
- computational complexity
- max sat
- lead time
- bin packing