Narrow search
Showing 11 - 14 of 14
Cover Image
Finding maximum subgraphs with relatively large vertex connectivity
Veremyev, Alexander; Prokopyev, Oleg A.; Boginski, Vladimir - In: European journal of operational research : EJOR 239 (2014) 2, pp. 349-362
Persistent link: https://www.econbiz.de/10010407899
Cover Image
A branch-and-price framework for decomposing graphs into relaxed cliques
Gschwind, Timo; Irnich, Stefan; Furini, Fabio - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 1070-1090
Persistent link: https://www.econbiz.de/10012631648
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
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