Approximation algorithms for the joint replenishment problem with deadlines (Q906550)
From MaRDI portal
(Redirected from Item:Q5326556)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms for the joint replenishment problem with deadlines |
scientific article; zbMATH DE number 6195420
- Approximation Algorithms for the Joint Replenishment Problem with Deadlines
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the joint replenishment problem with deadlines |
scientific article; zbMATH DE number 6195420 |
|
Statements
Approximation algorithms for the joint replenishment problem with deadlines (English)
0 references
Approximation Algorithms for the Joint Replenishment Problem with Deadlines (English)
0 references
22 January 2016
0 references
6 August 2013
0 references
joint replenishment problem
0 references
NP-completeness
0 references
APX-hardness
0 references
approximation algorithms
0 references
joint replenishment problem with deadlines
0 references
inventory theory
0 references
linear programming
0 references
integrality gap
0 references
randomized rounding
0 references
approximation algorithm
0 references
0 references
0.9930760264396667
0 references
0.8918234705924988
0 references