An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629)
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: An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. |
scientific article; zbMATH DE number 1929386
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. |
scientific article; zbMATH DE number 1929386 |
Statements
An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (English)
0 references
17 June 2003
0 references
Knapsack polytope
0 references
Facet-defining inequalities
0 references
Strong minimal covers
0 references
Tightening procedures
0 references
