2 citations · 2 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021
Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Santanu S. Dey, Prachi Shah
We show that there exists a family of instances of the lot-sizing problem, such that any branch-and-bound tree that solves them requires an exponential number of nodes, even in the…
math.OC2021★ 2 cited
A Theoretical and Computational Analysis of Full Strong-Branching
Santanu S. Dey, Yatharth Dubey, Marco Molinaro +1
Full strong-branching is a well-known variable selection rule that is known experimentally to produce significantly smaller branch-and-bound trees in comparison to all other known…