Narrow search
Showing 1 - 7 of 7
Cover Image
On the 2-club polytope of graphs
Mahdavi Pajouh, Foad; Balasundaram, Balabhaskar; Hicks, … - In: Operations research 64 (2016) 6, pp. 1466-1481
Persistent link: https://www.econbiz.de/10011620704
Cover Image
Detecting a most closeness-central clique in complex networks
Nasirian, Farzaneh; Mahdavi Pajouh, Foad; Balasundaram, … - In: European journal of operational research : EJOR 283 (2020) 2, pp. 461-475
Persistent link: https://www.econbiz.de/10012294843
Cover Image
Interdicting low-diameter cohesive subgroups in large-scale social networks
Daemi, Niloufar; Borrero, Juan S.; Balasundaram, Balabhaskar - In: INFORMS journal on optimization 4 (2022) 3, pp. 304-325
Persistent link: https://www.econbiz.de/10013373202
Cover Image
On fault-tolerant low-diameter clusters in graphs
Lu, Yajun; Salemi, Hosseinali; Balasundaram, Balabhaskar; … - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 6, pp. 3181-3199
Persistent link: https://www.econbiz.de/10014326738
Cover Image
On clique relaxation models in network analysis
Pattillo, Jeffrey; Youssef, Nalaty; Butenko, Sergiy - In: European journal of operational research : EJOR 226 (2013) 1, pp. 9-18
Persistent link: https://www.econbiz.de/10009715687
Cover Image
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag; Buchanan, Austin; Butenko, Sergiy - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 164-177
Persistent link: https://www.econbiz.de/10010505031
Cover Image
The maximum ratio clique problem
Sethuraman, Samyukta; Butenko, Sergiy - In: Computational Management Science : CMS 12 (2015) 1, pp. 197-218
Persistent link: https://www.econbiz.de/10010481762