Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand (Q2514765)
From MaRDI portal
 | 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 deterministic continuous-review inventory lot-sizing problems with time-varying demand |
scientific article; zbMATH DE number 6396100
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand |
scientific article; zbMATH DE number 6396100 |
Statements
Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand (English)
0 references
3 February 2015
0 references
inventory theory
0 references
approximation algorithms
0 references
continuous-review policy
0 references
deterministic model
0 references
0 references
0 references
0.8248838186264038
0 references
0.8179901242256165
0 references
0.8084241151809692
0 references
0.8065499663352966
0 references
0.7994707822799683
0 references
