Narrow search
Showing 1 - 5 of 5
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://ebvufind01.dmz1.zbw.eu/10010505031
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://ebvufind01.dmz1.zbw.eu/10014326738
Cover Image
On the maximum small-world subgraph problem
Kim, Jongeun; Veremyev, Alexander; Boginski, Vladimir; … - In: European journal of operational research : EJOR 280 (2020) 3, pp. 818-831
Persistent link: https://ebvufind01.dmz1.zbw.eu/10012132483
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://ebvufind01.dmz1.zbw.eu/10009715687
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://ebvufind01.dmz1.zbw.eu/10010481762