A branch-and-bound approach for maximum quasi-cliques
Year of publication: |
2014
|
---|---|
Authors: | Mahdavi Pajouh, Foad ; Miao, Zhuqi ; Balasundaram, Balabhaskar |
Published in: |
Data mining and informatics. - New York, NY : Springer. - 2014, p. 145-161
|
Subject: | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Branch-and-Bound | Branch and Bound | USA | United States | Theorie | Theory |
-
A branch-and-bound algortihm for the cell formation problem
Utkina, Irina E., (2018)
-
A general branch-and-bound algorithm for fair division problems
Vetschera, Rudolf, (2010)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
- More ...
-
An ellipsoidal bounding scheme for the quasi-clique number of a graph
Miao, Zhuqi, (2020)
-
On the 2-club polytope of graphs
Mahdavi Pajouh, Foad, (2016)
-
Detecting large risk-averse 2-clubs in graphs with random edge failures
Mahdavi Pajouh, Foad, (2017)
- More ...