The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard (Q5219699)
From MaRDI portal
scientific article; zbMATH DE number 7179911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-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
