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
Recommendations
- On the separation of topology-free rank inequalities for the max stable set problem
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- A branch and cut solver for the maximum stable set problem
- Bilevel programming and the separation problem
- Strengthening Chvátal-Gomory cuts for the stable set problem
Cites work
- scientific article; zbMATH DE number 956849 (Why is no real title available?)
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A branch and cut solver for the maximum stable set problem
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- A class of facet producing graphs for vertex packing polyhedra
- A combinatorial column generation algorithm for the maximum stable set problem
- A fast algorithm for the maximum clique problem
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A new exact maximum clique algorithm for large and massive sparse graphs
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- A review on algorithms for maximum clique problems
- A tutorial on branch and cut algorithms for the maximum stable set problem
- A unified framework for multistage mixed integer linear optimization
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact bit-parallel algorithm for the maximum clique problem
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- Bilevel programming and the separation problem
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Clique-detection models in computational biochemistry and genomics
- Computational Experience with Stable Set Relaxations
- Coordinated cutting plane generation via multi-objective separation
- Ellipsoidal relaxations of the stable set problem: theory and algorithms
- Exact algorithms for maximum clique: a computational study
- General cut-generating procedures for the stable set polytope
- Geometric algorithms and combinatorial optimization
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Maximum-weight stable sets and safe lower bounds for graph coloring
- On certain polytopes associated with graphs
- On the Shannon capacity of a graph
- On the facial structure of set packing polyhedra
- On the separation of topology-free rank inequalities for the max stable set problem
- Propositional truth maintenance systems: Classification and complexity analysis
- Reducibility among combinatorial problems
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Speeding up branch and bound algorithms for solving the maximum clique problem
- Stable sets, corner polyhedra and the Chvàtal closure
- Strong lift-and-project cutting planes for the stable set problem
- The ellipsoid method and its consequences in combinatorial optimization
- The maximum clique interdiction problem
- The maximum clique problem
- The smallest triangle-free 4-chromatic 4-regular graph
- The stable set problem: clique and nodal inequalities revisited
- Wheel inequalities for stable set polytopes
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086003)
