Narrow search
Showing 1 - 5 of 5
Cover Image
The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
Ma, Juan; Mahdavi Pajouh, Foad; Balasundaram, Balabhaskar; … - In: INFORMS journal on computing : JOC 28 (2016) 2, pp. 295-307
Persistent link: https://www.econbiz.de/10011489338
Cover Image
An ellipsoidal bounding scheme for the quasi-clique number of a graph
Miao, Zhuqi; Balasundaram, Balabhaskar - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 763-778
Persistent link: https://www.econbiz.de/10012294727
Cover Image
An integer programming approach for fault-tolerant connected dominating sets
Buchanan, Austin; Sung, Je Sang; Butenko, Sergiy; … - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 178-188
Persistent link: https://www.econbiz.de/10010505025
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
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