| Redesigning Benders decomposition for large-scale facility location M Fischetti, I Ljubić, M Sinnl Management Science 63 (7), 2146-2162, 2017 | 273 | 2017 |
| A new general-purpose algorithm for mixed-integer bilevel linear programs M Fischetti, I Ljubić, M Monaci, M Sinnl Operations Research 65 (6), 1615-1637, 2017 | 217 | 2017 |
| Benders decomposition without separability: A computational study for capacitated facility location problems M Fischetti, I Ljubić, M Sinnl European Journal of Operational Research 253 (3), 557-569, 2016 | 184 | 2016 |
| Thinning out Steiner trees: a node-based model for uniform edge costs M Fischetti, M Leitner, I Ljubić, M Luipersbeck, M Monaci, M Resch, ... Mathematical Programming Computation 9 (2), 203-229, 2017 | 133 | 2017 |
| Interdiction games and monotonicity, with application to knapsack problems M Fischetti, I Ljubić, M Monaci, M Sinnl INFORMS Journal on Computing 31 (2), 390-410, 2019 | 111 | 2019 |
| On the use of intersection cuts for bilevel optimization M Fischetti, I Ljubić, M Monaci, M Sinnl Mathematical Programming 172 (1), 77-103, 2018 | 93 | 2018 |
| Intersection cuts for bilevel optimization M Fischetti, I Ljubić, M Monaci, M Sinnl Integer Programming and Combinatorial Optimization: 18th International …, 2016 | 62 | 2016 |
| A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems M Leitner, I Ljubić, M Luipersbeck, M Sinnl INFORMS journal on computing 30 (2), 402-420, 2018 | 47 | 2018 |
| Benders decomposition for competitive influence maximization in (social) networks M Kahr, M Leitner, M Ruthmair, M Sinnl Omega 100, 102264, 2021 | 46 | 2021 |
| Large-scale influence maximization via maximal covering location E Güney, M Leitner, M Ruthmair, M Sinnl European Journal of Operational Research 289 (1), 144-164, 2021 | 45 | 2021 |
| An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem F Furini, I Ljubić, M Sinnl European journal of operational research 262 (2), 438-448, 2017 | 45 | 2017 |
| A dynamic reformulation heuristic for generalized interdiction problems M Fischetti, M Monaci, M Sinnl European Journal of Operational Research 267 (1), 40-51, 2018 | 41 | 2018 |
| A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem E Gaar, M Sinnl European Journal of Operational Research 303 (1), 78-98, 2022 | 26 | 2022 |
| Combining spatial information and optimization for locating emergency medical service stations: A case study for Lower Austria R Fritze, A Graser, M Sinnl International Journal of Medical Informatics 111, 24-36, 2018 | 25 | 2018 |
| Alteration of Golgi structure by stress: a link to neurodegeneration? EA Alvarez-Miranda, M Sinnl, H Farhan Frontiers in neuroscience 9, 435, 2015 | 25 | 2015 |
| A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem M Leitner, I Ljubić, M Sinnl INFORMS Journal on Computing 27 (1), 118-134, 2015 | 24 | 2015 |
| An algorithmic framework for the exact solution of tree-star problems M Leitner, I Ljubić, JJ Salazar-González, M Sinnl European Journal of Operational Research 261 (1), 54-66, 2017 | 21 | 2017 |
| ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design M Leitner, I Ljubić, M Sinnl, A Werner Computers & Operations Research 72, 128-146, 2016 | 20 | 2016 |
| A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints M Sinnl, I Ljubić Mathematical Programming Computation 8, 461-490, 2016 | 18 | 2016 |
| An exact method for binary fortification games M Leitner, I Ljubić, M Monaci, M Sinnl, K Tanınmış European Journal of Operational Research 307 (3), 1026-1039, 2023 | 17 | 2023 |
Ivana LjubicProfessor of Operations Research, ESSEC Business School, ParisVerified email at essec.edu
