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 |
-
Ozturk, Onur, (2017)
-
Multivariable branching : a 0-1 knapsack problem case study
Yang, Yu, (2021)
-
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland, (2019)
- More ...
-
Detecting large risk-averse 2-clubs in graphs with random edge failures
Mahdavi Pajouh, Foad, (2017)
-
The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
Ma, Juan, (2016)
-
Detecting a most closeness-central clique in complex networks
Nasirian, Farzaneh, (2020)
- More ...