A discrete EOQ problem is solvable in \(O(\log n)\) time (Q2482773)
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 5267280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A discrete EOQ problem is solvable in \(O(\log n)\) time |
scientific article; zbMATH DE number 5267280 |
Statements
A discrete EOQ problem is solvable in \(O(\log n)\) time (English)
0 references
24 April 2008
0 references
EOQ
0 references
inventory management
0 references
discrete optimization
0 references
0 references
0 references
0.83026993
0 references
0.82694834
0 references
0.80621046
0 references
0.80203414
0 references
0.8017496
0 references
0.8000264
0 references
0.7964387
0 references
