Complexity of inventory routing problems when routing is easy (Q6068536)
From MaRDI portal
!
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 7764306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of inventory routing problems when routing is easy |
scientific article; zbMATH DE number 7764306 |
Statements
Complexity of inventory routing problems when routing is easy (English)
0 references
13 November 2023
0 references
approximation
0 references
computational complexity
0 references
dynamic programming
0 references
inventory routing
0 references
periodic replenishment
0 references
pinwheel scheduling
0 references
0 references
0.808196485042572
0 references
0.7992035150527954
0 references
0.7802861928939819
0 references
0.7797641158103943
0 references
0.7667469382286072
0 references
