Narrow search
Showing 1 - 6 of 6
Cover Image
Exact algorithms for the minimum s-club partitioning problem
Yezerska, Oleksandra; Mahdavi Pajouh, Foad; Veremyev, … - In: Computational biomedicine, (pp. 267-291). 2019
Persistent link: https://www.econbiz.de/10012017790
Cover Image
A branch-and-bound approach for maximum quasi-cliques
Mahdavi Pajouh, Foad; Miao, Zhuqi; Balasundaram, Balabhaskar - In: Data mining and informatics, (pp. 145-161). 2014
Persistent link: https://www.econbiz.de/10010344210
Cover Image
First passage time interdiction in Markov chains
Daemi, Niloufar; Borrero, Juan S.; Balasundaram, Balabhaskar - In: Operations research letters : a journal of INFORMS … 54 (2024), pp. 1-7
Persistent link: https://www.econbiz.de/10015049298
Cover Image
Checking solvability of systems of interval linear equations and inequalities via mixed integer programming
Prokopyev, Oleg A.; Butenko, Sergiy; Trapp, Andrew - In: European journal of operational research : EJOR 199 (2009) 1, pp. 117-121
Persistent link: https://www.econbiz.de/10003863410
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