Pages that link to "Item:Q2664356"
From MaRDI portal
The following pages link to The stable set problem: clique and nodal inequalities revisited (Q2664356):
Displaying 7 items.
- Polyhedral results on the stable set problem in graphs containing even or odd pairs (Q1785209) (← links)
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)