Optimization Online


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

Santanu S. Dey (santanu.dey***at***isye.gatech.edu)
Prachi Shah (prachi.shah***at***gatech.edu)

Abstract: 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.

Keywords: exponential lower bound, lot-sizing, branch-and-bound

Category 1: Integer Programming (0-1 Programming )

Category 2: Integer Programming

Category 3: Integer Programming (Other )


Download: [PDF]

Entry Submitted: 12/07/2021
Entry Accepted: 12/07/2021
Entry Last Modified: 12/07/2021

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society