Narrow search
Showing 1 - 6 of 6
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
Efficient methods for the distance-based critical node detection problem in complex networks
Alozie, Glory Uche; Arulselvan, Ashwin; Akartunalı, Kerem - In: Computers & operations research : and their … 131 (2021), pp. 1-13
Persistent link: https://www.econbiz.de/10012533721
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 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
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
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