The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard (Q5219699)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7179911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard |
scientific article; zbMATH DE number 7179911 |
Statements
The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard (English)
0 references
12 March 2020
0 references
computational complexity
0 references
joint replenishment problem
0 references
supply chain management
0 references
twin primes
0 references
0 references
0 references
0 references
0 references
0.8019666075706482
0 references
0.7844253778457642
0 references
0.7687783241271973
0 references
0.7611193060874939
0 references
0.7532739043235779
0 references
