Integer factorization : why two-item joint replenishment is hard
Year of publication: |
2024
|
---|---|
Authors: | Schulz, Andreas S. ; Telha, Claudio |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 72.2024, 3, p. 1192-1202
|
Subject: | Optimization | computational complexity | integer factorization | joint replenishment | Theorie | Theory | Lagerhaltungsmodell | Inventory model | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Efficient methods for stochastic joint replenishment and delivery problem
Wang, Sirui, (2022)
-
Hochbaum, Dorit S., (2019)
-
Storage location assignment and I/O location design on storage planning
Hu, Michael H., (2016)
- More ...
-
On the complexity of a maintenance problem for hierarchical systems
Schulz, Andreas S., (2024)
-
Efficient approximation algorithms for the economic lot-sizing in continuous time
TELHA, Claudio, (2014)
-
A sequential Stackelberg game for dynamic inspection problems
Guzman, Cristobal, (2021)
- More ...