A fully polynomial time approximation scheme for the replenishment storage problem
Year of publication: |
2020
|
---|---|
Authors: | Hochbaum, Dorit S. ; Rao, Xu |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 6, p. 835-839
|
Subject: | Approximation algorithm | Fully polynomial time approximation scheme | Weakly NP-hard | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Hochbaum, Dorit S., (2019)
-
Vector scheduling with rejection on a single machine
Li, Weidong, (2018)
-
A fully polynomial time approximation scheme for the probability maximizing shortest path problem
Lee, Jisun, (2022)
- More ...
-
Algorithms and complexities of matching variants in covariate balancing
Hochbaum, Dorit S., (2023)
-
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
Hochbaum, Dorit S., (2021)
-
Hochbaum, Dorit S., (2019)
- More ...