A computational analysis of lower bounds for big bucket production planning problems (Q1935570)
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 6137006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational analysis of lower bounds for big bucket production planning problems |
scientific article; zbMATH DE number 6137006 |
Statements
A computational analysis of lower bounds for big bucket production planning problems (English)
0 references
18 February 2013
0 references
production planning
0 references
lot-sizing
0 references
integer programming
0 references
strong formulations
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.815270721912384
0 references
0.7412303686141968
0 references
0.731867790222168
0 references
0.7277833223342896
0 references
