The stable set problem: clique and nodal inequalities revisited
From MaRDI portal
Publication:2664356
Recommendations
- Strengthened clique-family inequalities for the stable set polytope
- Stable sets in claw-free graphs: a journey through algorithms and polytopes
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
- Cliques and stable sets in undirected graphs
- A note on hitting maximum and maximal cliques with a stable set
- scientific article; zbMATH DE number 1187143
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Polyhedral results on the stable set problem in graphs containing even or odd pairs
- The stable set problem and the thinness of a graph
Cites work
- A branch and cut solver for the maximum stable set problem
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- A fast algorithm for the maximum clique problem
- A multi-KP modeling for the maximum-clique problem
- A new trust region technique for the maximum weight clique problem
- A review on algorithms for maximum clique problems
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- An application of the Lovász-Schrijver M(K, K) operator to the stable set problem
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Computational Experience with Stable Set Relaxations
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Ellipsoidal relaxations of the stable set problem: theory and algorithms
- Exact algorithms for maximum clique: a computational study
- Exploring the relationship between max-cut and stable set relaxations
- Facets for node packing
- General cut-generating procedures for the stable set polytope
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 4213473 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 956840 (Why is no real title available?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New facets for the set packing polytope
- On certain polytopes associated with graphs
- On the facial structure of set packing polyhedra
- Properties of vertex packing and independence system polyhedra
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Speeding up branch and bound algorithms for solving the maximum clique problem
- Strong lift-and-project cutting planes for the stable set problem
- The chromatic number of random graphs
- The maximum clique problem
- Wheel inequalities for stable set polytopes
Cited in
(12)- Polyhedral results on the stable set problem in graphs containing even or odd pairs
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
- Worst-case analysis of clique MIPs
- An SDP-based approach for computing the stability number of a graph
- Boosting ant colony optimization via solution prediction and machine learning
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- scientific article; zbMATH DE number 956842 (Why is no real title available?)
- An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints
- Column (and row) generation algorithms for the pallet loading problem
- Application of the Lovász-Schrijver operator to compact stable set integer programs
- A parallel branch-and-bound-and-check algorithm for nesting
This page was built for publication: The stable set problem: clique and nodal inequalities revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664356)
