\(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563)
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: \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates |
scientific article; zbMATH DE number 755291
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates |
scientific article; zbMATH DE number 755291 |
Statements
\(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (English)
0 references
1993
0 references
alternates
0 references
tightening
0 references
maximal cliques
0 references
extensions of minimal covers
0 references
knapsack constraints
0 references
LP relaxations
0 references
0 references
0 references
0.94763553
0 references
0.87427866
0 references
0.8738055
0 references
0.87287545
0 references
0.87123287
0 references
0.8704351
0 references
0 references
