Approximation algorithms for inventory problems with submodular or routing costs (Q344939)
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 inventory problems with submodular or routing costs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for inventory problems with submodular or routing costs |
scientific article |
Statements
Approximation algorithms for inventory problems with submodular or routing costs (English)
0 references
25 November 2016
0 references
inventory management
0 references
approximation algorithms
0 references
submodular function
0 references
joint replenishment problem
0 references
inventory routing problem
0 references
0 references
0 references
0 references
0 references
0 references
0.9298945069313048
0 references
0.8734307289123535
0 references
0.8135658502578735
0 references
0.8017624616622925
0 references
0.7969347238540649
0 references
