A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756)
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 polyhedral study on 0-1 knapsack problems with set packing constraints |
scientific article; zbMATH DE number 6945864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polyhedral study on 0-1 knapsack problems with set packing constraints |
scientific article; zbMATH DE number 6945864 |
Statements
A polyhedral study on 0-1 knapsack problems with set packing constraints (English)
0 references
1 October 2018
0 references
knapsack polytope
0 references
cover inequality
0 references
facets
0 references
set packing polytope
0 references
0.8989402055740356
0 references
0.8683400750160217
0 references
0.8682243227958679
0 references
0.8472990989685059
0 references
