O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
DOI10.1007/BF02574740zbMATH Open0820.90074OpenAlexW1966144616WikidataQ40817310 ScholiaQ40817310MaRDI QIDQ1804563FDOQ1804563
A. Garin, Gloria Pérez, Laureano F. Escudero Bueno, Brenda L. Dietrich
Publication date: 1993
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02574740
Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Cites Work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Title not available (Why is that?)
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Outline of an algorithm for integer solutions to linear programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Finding a Maximum Clique in an Arbitrary Graph
- An exact algorithm for the maximum clique problem
- Edmonds polytopes and a hierarchy of combinatorial problems
- On tightening cover induced inequalities
- Efficient reformulation for 0-1 programs -- methods and computational results
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Title not available (Why is that?)
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- Generating cuts in integer programming with families of special ordered sets
Cited In (11)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
- On identifying dominant cliques.
- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- \(O(n \log n)\) procedures for tightening cover inequalities
- 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
- Detecting constraint redundancy in 0-1 linear programming problems
- Title not available (Why is that?)
- A note for tightening 0-1 models
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- Some properties of cliques in 0-1 mixed integer programs
Uses Software
Recommendations
- 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 👍 👎
- Title not available (Why is that?) 👍 👎
- Exact algorithms for dominating clique problems (extended abstract) 👍 👎
- On the approximability of clique and related maximization problems 👍 👎
- The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract) 👍 👎
- Methods of finding all minimum coverings of a graph by cliques 👍 👎
- Title not available (Why is that?) 👍 👎
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs 👍 👎
- Algorithm Theory - SWAT 2004 👍 👎
This page was built for publication: \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804563)
