Narrow search
Showing 1 - 5 of 5
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
Finding influential groups in networked systems : the most degree-central clique problem
Zhong, Haonan; Mahdavi Pajouh, Foad; Prokopyev, Oleg - In: Omega : the international journal of management science 101 (2021), pp. 1-13
Persistent link: https://www.econbiz.de/10012494674
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
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
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