Constant approximation algorithm for non-uniform capacitated multi-item lot-sizing via strong covering inequalities (Q4575900)
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 6904180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant approximation algorithm for non-uniform capacitated multi-item lot-sizing via strong covering inequalities |
scientific article; zbMATH DE number 6904180 |
Statements
Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities (English)
0 references
16 July 2018
0 references
approximation algorithm
0 references
lot-sizing problem
0 references
0.976011335849762
0 references
0.8960385322570801
0 references
0.8895184397697449
0 references
0.784026563167572
0 references
0.7618537545204163
0 references
