Pages that link to "Item:Q1124826"
From MaRDI portal
The following pages link to \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826):
Displaying 9 items.
- Second-order cover inequalities (Q927162) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (Q1265899) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) (← links)
- Partial cover and complete cover inequalities (Q1331885) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- A correction of the justification of the Dietrich-Escudero-Garín-Pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1924444) (← links)
