Narrow search
Showing 1 - 7 of 7
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
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 integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
Veremyev, Alexander; Boginski, Vladimir; Pasiliao, … - In: European journal of operational research : EJOR 297 (2022) 1, pp. 86-101
Persistent link: https://www.econbiz.de/10013259230
Cover Image
Algorithms for the maximum k-club problem in graphs
Shahinpour, Shahram; Butenko, Sergiy - In: Journal of combinatorial optimization 26 (2013) 3, pp. 520-554
Persistent link: https://www.econbiz.de/10010204553
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
Cover Image
Detecting robust cliques in graphs subject to uncertain edge failures
Yezerska, Oleksandra; Butenko, Sergiy; Boginski, Vladimir L. - In: Risk management approaches in engineering applications, (pp. 109-132). 2018
Persistent link: https://www.econbiz.de/10011870005
Cover Image
A lagrangian bound on the clique number and an exact algorithm for the maximum edge weight clique problem
Hosseinian, Seyedmohammadhossein; Fontes, Dalila B. M. M.; … - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 747-762
Persistent link: https://www.econbiz.de/10012294726