\(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563)
From MaRDI portal
scientific article
| 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 |
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
