On identifying dominant cliques.
From MaRDI portal
Publication:1811147
DOI10.1016/S0377-2217(02)00472-1zbMath1035.90095MaRDI QIDQ1811147
Susana Muñoz, Laureano Fernando Escudero Bueno
Publication date: 10 June 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00472-1
90C35: Programming involving graphs or networks
90C10: Integer programming
90C09: Boolean programming
Uses Software
Cites Work
- An exact algorithm for the maximum clique problem
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- Efficient reformulation for 0-1 programs -- methods and computational results
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- 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
- Conflict graphs in solving integer programming problems
- Dioïds and semirings: Links to fuzzy sets and other applications
- Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut
- Solving Large-Scale Zero-One Linear Programming Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- On the facial structure of set packing polyhedra
- Algorithm 457: finding all cliques of an undirected graph
