Narrow search
Showing 1 - 6 of 6
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
On the maximum small-world subgraph problem
Kim, Jongeun; Veremyev, Alexander; Boginski, Vladimir; … - In: European journal of operational research : EJOR 280 (2020) 3, pp. 818-831
Persistent link: https://www.econbiz.de/10012132483
Cover Image
On exact solution approaches for the longest induced path problem
Matsypura, Dmytro; Veremyev, Alexander; Prokopyev, Oleg; … - In: European journal of operational research : EJOR 278 (2019) 2, pp. 546-562
Persistent link: https://www.econbiz.de/10012102561
Cover Image
Finding the most degree-central walks and paths in a graph : exact and heuristic approaches
Matsypura, Dmytro; Veremyev, Alexander; Pasiliao, Eduardo L. - In: European journal of operational research : EJOR 308 (2023) 3, pp. 1021-1036
Persistent link: https://www.econbiz.de/10014311874
Cover Image
Finding clique clusters with the highest betweenness centrality
Rysz, Maciej; Mahdavi Pajouh, Foad; Pasiliao, Eduardo L. - In: European journal of operational research : EJOR 271 (2018) 1, pp. 155-164
Persistent link: https://www.econbiz.de/10011882787
Cover Image
On designing networks resilient to clique blockers
Zhong, Haonan; Mahdavi Pajouh, Foad; Prokopyev, Oleg - In: European journal of operational research : EJOR 307 (2023) 1, pp. 20-32
Persistent link: https://www.econbiz.de/10014292759