Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities (Q3168976)
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 5881581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities |
scientific article; zbMATH DE number 5881581 |
Statements
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities (English)
0 references
27 April 2011
0 references
inventory management
0 references
approximation
0 references
flow-cover inequalities
0 references
algorithms
0 references
0.994165539741516
0 references
0.9126958847045898
0 references
0.8960385322570801
0 references
0.8002088665962219
0 references
0.797336757183075
0 references
