Persistency of linear programming relaxations for the stable set problem
From MaRDI portal
Recommendations
- Persistency of linear programming relaxations for the stable set problem
- Persistency in 0-1 polynomial programming
- On LP-based approximation for copositive formulation of stable set problem
- Average case polyhedral complexity of the maximum stable set problem
- Average case polyhedral complexity of the maximum stable set problem
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- A class of facet producing graphs for vertex packing polyhedra
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Minimum node covers and 2-bicritical graphs
- On Linear Characterizations of Combinatorial Optimization Problems
- On certain polytopes associated with graphs
- On the facial structure of set packing polyhedra
- Persistency of linear programming relaxations for the stable set problem
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Vertex packings: Structural properties and algorithms
Cited in
(3)
This page was built for publication: Persistency of linear programming relaxations for the stable set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041757)