Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
From MaRDI portal
Publication:5086003
DOI10.1287/ijoc.2021.1115OpenAlexW3188298178MaRDI QIDQ5086003
Stefano Gualandi, Stefano Coniglio
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/450458/1/JOC_paper_final.pdf
integer programmingbranch-and-boundbranch-and-cutbilevel programmingrank inequalitiesmaximum stable set problemcutting plane generation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new exact maximum clique algorithm for large and massive sparse graphs
- Strong lift-and-project cutting planes for the stable set problem
- Bilevel programming and the separation problem
- A branch and cut solver for the maximum stable set problem
- An exact bit-parallel algorithm for the maximum clique problem
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Stable sets, corner polyhedra and the Chvàtal closure
- The ellipsoid method and its consequences in combinatorial optimization
- Geometric algorithms and combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- The maximum clique problem
- Wheel inequalities for stable set polytopes
- A combinatorial column generation algorithm for the maximum stable set problem
- On certain polytopes associated with graphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- A fast algorithm for the maximum clique problem
- The maximum clique interdiction problem
- Exact algorithms for maximum clique: a computational study
- General cut-generating procedures for the stable set polytope
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- Propositional truth maintenance systems: Classification and complexity analysis
- Maximum-weight stable sets and safe lower bounds for graph coloring
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Speeding up branch and bound algorithms for solving the maximum clique problem
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- Coordinated cutting plane generation via multi-objective separation
- Clique-detection models in computational biochemistry and genomics
- A review on algorithms for maximum clique problems
- The stable set problem: clique and nodal inequalities revisited
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- On the Shannon capacity of a graph
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Computational Experience with Stable Set Relaxations
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Reducibility among Combinatorial Problems
- A Unified Framework for Multistage Mixed Integer Linear Optimization
- On the facial structure of set packing polyhedra
- The smallest triangle-free 4-chromatic 4-regular graph
- A branch-and-cut algorithm for the maximum cardinality stable set problem
This page was built for publication: Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
