Complexity of one packing optimization problem (Q289799)
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: Complexity of one packing optimization problem |
scientific article; zbMATH DE number 6587918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of one packing optimization problem |
scientific article; zbMATH DE number 6587918 |
Statements
Complexity of one packing optimization problem (English)
0 references
31 May 2016
0 references
packing optimization
0 references
integer multicommodity flow
0 references
labor input of exhaustive search
0 references
polynomial reducibility
0 references
NP-complete problems
0 references
0.7633633017539978
0 references
0.7474117279052734
0 references
0.744874119758606
0 references
0.7423678040504456
0 references
