Persistency of linear programming relaxations for the stable set problem
From MaRDI portal
Publication:2118136
DOI10.1007/s10107-020-01600-3zbMath1489.90162arXiv1911.01478OpenAlexW3120503500MaRDI QIDQ2118136
Elisabeth Rodríguez-Heck, Stefan Weltge, Karl Stickler, Matthias Walter
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01478
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Random near-regular graphs and the node packing problem
- An exact threshold theorem for random graphs and the node-packing problem
- A class of facet producing graphs for vertex packing polyhedra
- On certain polytopes associated with graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Minimum node covers and 2-bicritical graphs
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Vertex packings: Structural properties and algorithms
- On the integer-valued variables in the linear vertex packing problem
- On Linear Characterizations of Combinatorial Optimization Problems
- On the facial structure of set packing polyhedra
This page was built for publication: Persistency of linear programming relaxations for the stable set problem
