The following pages link to (Q5687256):
Displaying 13 items.
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- Struction revisited (Q1414580) (← links)
- Routing trains through a railway station based on a node packing model (Q1592731) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← 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)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)
