Narrow search
Showing 1 - 6 of 6
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
Cover Image
The optimal design of low-latency virtual backbones
Validi, Hamidreza; Buchanan, Austin - In: INFORMS journal on computing : JOC 32 (2020) 4, pp. 952-967
Persistent link: https://www.econbiz.de/10012390173
Cover Image
A scenario decomposition algorithm for stochastic programming problems with a class of downside risk measures
Rysz, Maciej; Vinel, Alexander; Krokhmal, Pavlo; … - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 416-430
Persistent link: https://www.econbiz.de/10011291285
Cover Image
Finding critical links for closeness centrality
Veremyev, Alexander; Prokopyev, Oleg; Pasiliao, Eduardo L. - In: INFORMS journal on computing : JOC 31 (2019) 2, pp. 367-389
Persistent link: https://www.econbiz.de/10012036790
Cover Image
Fortification against cascade propagation under uncertainty
Gillen, Colin P.; Veremyev, Alexander; Prokopyev, Oleg; … - In: INFORMS journal on computing : JOC 33 (2021) 4, pp. 1481-1499
Persistent link: https://www.econbiz.de/10012796940