O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates

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
scientific article; zbMATH DE number 522858
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
scientific article; zbMATH DE number 3893237
Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
Algorithm Theory - SWAT 2004

Cites work

scientific article; zbMATH DE number 3908160 (Why is no real title available?)
scientific article; zbMATH DE number 193411 (Why is no real title available?)
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
An exact algorithm for the maximum clique problem
Edmonds polytopes and a hierarchy of combinatorial problems
Efficient reformulation for 0-1 programs -- methods and computational results
Finding a Maximum Clique in an Arbitrary Graph
Generating cuts in integer programming with families of special ordered sets
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
On tightening cover induced inequalities
Outline of an algorithm for integer solutions to linear programs
S3 sets. An extension of the Beale-Tomlin special ordered sets
Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
Solving Large-Scale Zero-One Linear Programming Problems
Solving Mixed Integer Programming Problems Using Automatic Reformulation

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.
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
scientific article; zbMATH DE number 2108946 (Why is no real title available?)
A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
A note for tightening 0-1 models
Some properties of cliques in 0-1 mixed integer programs

Describes a project that uses

Uses Software

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)