\(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
type: Item
instance of: scholarly article
title: \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
zbMATH Open document ID: 0820.90074
DOI: 10.1007/BF02574740
published in: Top
publication date: 1993-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 755291
zbMATH Keywords: alternates
zbMATH Keywords: tightening
zbMATH Keywords: maximal cliques
zbMATH Keywords: extensions of minimal covers
zbMATH Keywords: knapsack constraints
zbMATH Keywords: LP relaxations
Wikidata QID: Q40817310
author: Brenda L. Dietrich
author: Laureano F. Escudero Bueno
author: A. Garin
author: Gloria Pérez
describes a project that uses: OSL
MaRDI profile type: Publication
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: An exact algorithm for the maximum clique problem
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: On tightening cover induced inequalities
cites work: Efficient reformulation for 0-1 programs -- methods and computational results
cites work: S3 sets. An extension of the Beale-Tomlin special ordered sets
cites work: On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
cites work: Q3686494
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: Q4040221
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation
cites work: Generating cuts in integer programming with families of special ordered sets
full work available at URL: https://doi.org/10.1007/bf02574740
OpenAlex ID: W1966144616
Recommended article: 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
Recommended article: Q4284253
Recommended article: Exact Algorithms for Dominating Clique Problems
Recommended article: On the approximability of clique and related maximization problems
Recommended article: The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)
Recommended article: Methods of finding all minimum coverings of a graph by cliques
Recommended article: Q5184940
Recommended article: Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
Recommended article: Algorithm Theory - SWAT 2004
description: scientific article; zbMATH DE number 755291