\(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026)
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: L-class enumeration algorithms for a discrete production planning problem with interval resource quantities |
scientific article; zbMATH DE number 5363300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities |
scientific article; zbMATH DE number 5363300 |
Statements
\(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (English)
0 references
7 November 2008
0 references
production planning
0 references
integer programming
0 references
interval data
0 references
regular partitions
0 references
0 references
0.8262497186660767
0 references
0.7191525101661682
0 references
0.7177973985671997
0 references
0.7132505774497986
0 references
