Name
Abstract | ||
|---|---|---|
•The stable set problem is a fundamental problem in combinatorial optimisation.•It can be formulated as an integer program in many different ways.•We consider formulations based on clique inequalities, nodal inequalities, or a combination of the two.•We perform a detailed theoretical and computational study of these formulations.•The best formulations work very well on both random and structured instances. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.cor.2020.105024 | Computers & Operations Research |
Keywords | DocType | Volume |
Stable set problem,Clique inequalities,Nodal inequalities | Journal | 123 |
ISSN | Citations | PageRank |
0305-0548 | 1 | 0.36 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adam N. Letchford | 1 | 671 | 54.97 |
| Fabrizio Rossi | 2 | 140 | 16.33 |
| Stefano Smriglio | 3 | 153 | 14.81 |