A polynomial time algorithm for convex cost lot-sizing problems (Q1785380)
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: A polynomial time algorithm for convex cost lot-sizing problems |
scientific article; zbMATH DE number 6945370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for convex cost lot-sizing problems |
scientific article; zbMATH DE number 6945370 |
Statements
A polynomial time algorithm for convex cost lot-sizing problems (English)
0 references
28 September 2018
0 references
convex cost lot sizing
0 references
polynomial time algorithms
0 references
production and inventory systems
0 references
supply chain management
0 references
0 references
0 references
0.94383085
0 references
0.9025924
0 references
0.9006984
0 references
0.8966832
0 references
0.89628863
0 references
0 references
0.89417255
0 references
0.8869597
0 references
