A Lot-Sizing Problem on Trees, Related to Network Design (Q5287989)
From MaRDI portal
!
WARNING
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 243328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lot-Sizing Problem on Trees, Related to Network Design |
scientific article; zbMATH DE number 243328 |
Statements
A Lot-Sizing Problem on Trees, Related to Network Design (English)
0 references
5 August 1993
0 references
capacity expansion
0 references
trees
0 references
knapsack
0 references
economic lot-sizing
0 references
\(\varepsilon\)- approximate algorithms
0 references
0.801907479763031
0 references
0.7593830227851868
0 references
0.7584867477416992
0 references
0.7579237222671509
0 references
