| An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem I Ljubić, R Weiskircher, U Pferschy, GW Klau, P Mutzel, M Fischetti Mathematical programming 105, 427-449, 2006 | 288 | 2006 |
| Redesigning Benders decomposition for large-scale facility location M Fischetti, I Ljubić, M Sinnl Management Science 63 (7), 2146-2162, 2017 | 258 | 2017 |
| Solving the simple plant location problem by genetic algorithm J Kratica, D Tošic, V Filipović, I Ljubić RAIRO-Operations Research 35 (1), 127-142, 2001 | 255 | 2001 |
| 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 | 206 | 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 | 172 | 2016 |
| The regenerator location problem S Chen, I Ljubić, S Raghavan Networks: An International Journal 55 (3), 205-220, 2010 | 150 | 2010 |
| A survey on mixed-integer programming techniques in bilevel optimization T Kleinert, M Labbé, I Ljubić, M Schmidt EURO Journal on Computational Optimization 9, 100007, 2021 | 148 | 2021 |
| On the use of intersection cuts for bilevel optimization M Fischetti, I Ljubić, M Monaci, M Sinnl Mathematical Programming 172 (1), 77-103, 2018 | 131* | 2018 |
| MIP models for connected facility location: A theoretical and computational study S Gollowitzer, I Ljubić Computers & Operations Research 38 (2), 435-449, 2011 | 124 | 2011 |
| 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 | 122 | 2017 |
| Benders decomposition for very large scale partial set covering and maximal covering location problems JF Cordeau, F Furini, I Ljubić European Journal of Operational Research 275 (3), 882-896, 2019 | 116 | 2019 |
| Interdiction Games and Monotonicity, with Application to Knapsack Problems M Fischetti, I Ljubic, M Monaci, M Sinnl INFORMS Journal on Computing, 2019, 2016 | 99* | 2016 |
| Outer approximation and submodular cuts for maximum capture facility location problems with random utilities I Ljubić, E Moreno European Journal of Operational Research 266 (1), 46-56, 2018 | 92 | 2018 |
| Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem GW Klau, I Ljubić, A Moser, P Mutzel, P Neuner, U Pferschy, G Raidl, ... Genetic and Evolutionary Computation Conference, 1304-1315, 2004 | 92 | 2004 |
| The maximum weight connected subgraph problem E Álvarez-Miranda, I Ljubić, P Mutzel Facets of combinatorial optimization: Festschrift for Martin Grötschel, 245-270, 2013 | 84 | 2013 |
| A genetic algorithm for the index selection problem J Kratica, I Ljubić, D Tošić Applications of Evolutionary Computing: EvoWorkshops 2003: EvoBIO, EvoCOP …, 2003 | 78 | 2003 |
| Location of charging stations in electric car sharing systems G Brandstätter, M Leitner, I Ljubić Transportation Science 54 (5), 1408-1438, 2020 | 67 | 2020 |
| Exact and memetic algorithms for two network design problems I Ljubic PhD, Technische Universitat Wien, Vienna Austria, 2004 | 67 | 2004 |
| The recoverable robust facility location problem E Álvarez-Miranda, E Fernández, I Ljubić Transportation Research Part B: Methodological 79, 93-120, 2015 | 58 | 2015 |
| A tailored Benders decomposition approach for last-mile delivery with autonomous robots L Alfandari, I Ljubić, MDM da Silva European Journal of Operational Research 299 (2), 510-525, 2022 | 57 | 2022 |
Markus SinnlJohannes Kepler University Linz在 jku.at 的电子邮件经过验证
