Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
Year of publication: |
2016
|
---|---|
Authors: | Akartunalı, Kerem ; Fragkos, Ioannis ; Miller, Andrew J. ; Wu, Tao |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 28.2016, 4, p. 766-780
|
Subject: | lot-sizing | integer programming | local cuts | convex hull closure | quadratic programming | column generation | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Losgröße | Lot size | Ganzzahlige Optimierung | Integer programming |
-
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
Cunha, Jesus O., (2019)
-
Dantzig-Wolfe decomposition for the facility location and production planning problem
Wu, Tao, (2020)
-
Integrating two-dimensional cutting stock and lot-sizing problems
Silva, E., (2014)
- More ...
-
Progressive selection method for the coupled lot-sizing and cutting-stock problem
Wu, Tao, (2017)
-
Exact method for production hub location
Wu, Tao, (2024)
-
Technical note : on nested partitions method for global optimization
Wu, Tao, (2021)
- More ...