A branch and cut solver for the maximum stable set problem
Year of publication: |
2011
|
---|---|
Authors: | Rebennack, Steffen ; Oswald, Marcus ; Theis, Dirk Oliver ; Seitz, Hanna ; Reinelt, Gerhard |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 21.2011, 4, p. 434-457
|
Subject: | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | USA | United States | Theorie | Theory |
-
Leitner, Markus, (2018)
-
Paulavičius, Remigijus, (2010)
-
A branch-and-bound approach for maximum quasi-cliques
Mahdavi Pajouh, Foad, (2014)
- More ...
-
Applying mod-k-cuts for solving linear ordering problems
Oswald, Marcus, (2009)
-
On a binary distance model for the minimum linear arrangement problem
Reinelt, Gerhard, (2014)
-
On a binary distance model for the minimum linear arrangement problem
Reinelt, Gerhard, (2014)
- More ...