# Lower bound on size of branch-and-bound trees for solving lot-sizing problem

arXiv: https://arxiv.org/abs/2112.03965 · HTML: https://mlsanity.com/paper/2112.03965/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Dec 2021.

## Built on by (most cited first, 1 of 1)

- [Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods](https://mlsanity.com/paper/2406.06954/) (2024)

## Abstract (arXiv)

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 case when the branchings are performed on general split disjunctions.