Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Year of publication: |
2022
|
---|---|
Authors: | Dey, Santanu S. ; Shah, Prachi |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 5, p. 430-433
|
Subject: | Branch-and-bound | Lot-sizing | Lower bound | Theorie | Theory | Losgröße | Lot size | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming |
-
Zegordi, Seyed Hessameddin, (2018)
-
Trigos, Federico, (2016)
-
Khalilpourazari, Soheyl, (2020)
- More ...
-
Two row mixed integer cuts via lifting
Dey, Santanu S., (2008)
-
Linear-programming-based lifting and its application to primal cutting-plane algorithms
Dey, Santanu S., (2009)
-
Facets of two-dimensional infinite group problems
Dey, Santanu S., (2008)
- More ...