Pages that link to "Item:Q1804563"
From MaRDI portal
The following pages link to \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563):
Displaying 10 items.
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← 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)
- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems (Q5101409) (← links)
- A note for tightening 0-1 models (Q5937145) (← links)
- Detecting constraint redundancy in 0-1 linear programming problems (Q6597116) (← links)
