Multiechelon lot sizing : new complexities and inequalities
Year of publication: |
2020
|
---|---|
Authors: | Zhao, Ming ; Zhang, Minjiao |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 2, p. 534-551
|
Subject: | analysis of algorithms: computational complexity | programming: integer | algorithms | cutting plane | Optimization | lot sizing | dynamic programming | network flow | polynomial-time algorithms | valid inequalities | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Losgröße | Lot size | Algorithmus | Algorithm | Dynamische Optimierung | Dynamic programming | Produktionssteuerung | Production control |
-
Goisque, Guillaume, (2017)
-
Improved exact algorithms to economic lot-sizing with piecewise linear production costs
Ou, Jinwen, (2017)
-
A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
Bunn, Kevin A., (2023)
- More ...
-
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
Zhang, Minjiao, (2012)
-
Improving disaster relief plans for hurricanes with social media
Paul, Jomon A., (2024)
-
A branch-and-cut method for dynamic decision making under joint chance constraints
Zhang, Minjiao, (2014)
- More ...