Strengthening Chvátal-Gomory Cuts for the Stable Set Problem
From MaRDI portal
Publication:2835677
DOI10.1007/978-3-319-45587-7_18zbMath1452.90272OpenAlexW2416465474MaRDI QIDQ2835677
Adam N. Letchford, Stefano Smriglio, Francesca Marzi, Fabrizio Rossi
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/79029/7/isco_stable_set.pdf
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A strengthened general cut-generating procedure for the stable set polytope
- Strong lift-and-project cutting planes for the stable set problem
- A branch and cut solver for the maximum stable set problem
- The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Optimizing over the first Chvátal closure
- Geometric algorithms and combinatorial optimization
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Improving upper bounds for the clique number by non-valid inequalities
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- Edmonds polytopes and a hierarchy of combinatorial problems
- Copositivity cuts for improving SDP bounds on the clique number
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms
- On the Chvátal rank of linear relaxations of the stable set polytope
- Outline of an algorithm for integer solutions to linear programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- On the Shannon capacity of a graph
- Computational Experience with Stable Set Relaxations
- On the facial structure of set packing polyhedra
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A branch-and-cut algorithm for the maximum cardinality stable set problem
