Optimal Lot-Sizing Algorithms for Complex Product Structures (Q3738876)
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: Optimal Lot-Sizing Algorithms for Complex Product Structures |
scientific article; zbMATH DE number 3972583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Lot-Sizing Algorithms for Complex Product Structures |
scientific article; zbMATH DE number 3972583 |
Statements
Optimal Lot-Sizing Algorithms for Complex Product Structures (English)
0 references
1986
0 references
Lot sizing
0 references
complex product structure
0 references
additional constraints
0 references
branch- and-bound
0 references
Lagrangean relaxation
0 references
subgradient optimization
0 references
tight lower bounds
0 references
computational experiments
0 references
0.8292697072029114
0 references
0.8234431147575378
0 references
0.7849782109260559
0 references
0.7841506004333496
0 references
