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)
-
A binary branch and bound algorithm to minimize maximum scheduling cost
Chandra, Charu, (2014)
-
Morrison, David Robert, (2014)
- More ...
-
A specialty steel bar company uses analytics to determine available-to-promise dates
Mahdavi Pajouh, Foad, (2013)
-
The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
Ma, Juan, (2016)
-
On the 2-club polytope of graphs
Mahdavi Pajouh, Foad, (2016)
- More ...