Narrow search
Showing 1 - 7 of 7
Cover Image
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Şuvak, Zeynep; Altınel, İ. Kuban; Aras, Necati - In: European journal of operational research : EJOR 287 (2020) 2, pp. 410-437
Persistent link: https://www.econbiz.de/10012293831
Cover Image
Frequency-driven tabu search for the maximum s-plex problem
Zhou, Yi; Hao, Jin-Kao - In: Computers & operations research : and their … 86 (2017), pp. 65-78
Persistent link: https://www.econbiz.de/10011732201
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
Algorithms for the maximum k-club problem in graphs
Shahinpour, Shahram; Butenko, Sergiy - In: Journal of combinatorial optimization 26 (2013) 3, pp. 520-554
Persistent link: https://www.econbiz.de/10010204553
Cover Image
An analytical comparison of the LP relaxations of integer models for the k-club problem
Almeida, Maria Teresa; Carvalho, Filipa D. - In: European journal of operational research : EJOR 232 (2014) 3, pp. 489-498
Persistent link: https://www.econbiz.de/10010224968
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
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