×

zbMATH — the first resource for mathematics

Ljubić, Ivana

Compute Distance To:
Author ID: ljubic.ivana Recent zbMATH articles by "Ljubić, Ivana"
Published as: Ljubic, Ivana; Ljubić, Ivana
External Links: MGP · ORCID
Documents Indexed: 66 Publications since 2001, including 1 Book

Publications by Year

Citations contained in zbMATH

52 Publications have been cited 361 times in 227 Documents Cited by Year
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Zbl 1085.90061
Ljubić, Ivana; Weiskircher, René; Pferschy, Ulrich; Klau, Gunnar W.; Mutzel, Petra; Fischetti, Matteo
51
2006
The regenerator location problem. Zbl 1200.90113
Chen, Si; Ljubić, Ivana; Raghavan, S.
27
2010
Solving the simple plant location problem by genetic algorithm. Zbl 0995.90055
Kratica, Jozef; Tošic, Dušan; Filipović, Vladimir; Ljubić, Ivana
27
2001
Thinning out Steiner trees: a node-based model for uniform edge costs. Zbl 1387.90132
Fischetti, Matteo; Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Monaci, Michele; Resch, Max; Salvagnin, Domenico; Sinnl, Markus
24
2017
MIP models for connected facility location: a theoretical and computational study. Zbl 1231.90267
Gollowitzer, Stefan; Ljubić, Ivana
19
2011
Benders decomposition without separability: a computational study for capacitated facility location problems. Zbl 1346.90490
Fischetti, Matteo; Ljubić, Ivana; Sinnl, Markus
18
2016
A new general-purpose algorithm for mixed-integer bilevel linear programs. Zbl 1386.90085
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus
13
2017
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. Zbl 1302.90136
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Toth, Paolo
11
2013
The maximum weight connected subgraph problem. Zbl 1317.90299
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Mutzel, Petra
10
2013
Exact approaches to the single-source network loading problem. Zbl 1241.90018
Ljubić, Ivana; Putz, Peter; Salazar-González, Juan-José
10
2012
The generalized regenerator location problem. Zbl 1329.90026
Chen, Si; Ljubić, Ivana; Raghavan, S.
9
2015
Hop constrained Steiner trees with multiple root nodes. Zbl 1338.90266
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
9
2014
Intersection cuts for bilevel optimization. Zbl 1419.90076
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus
8
2016
The two-level diameter constrained spanning tree problem. Zbl 1309.90065
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
8
2015
Obtaining optimal \(k\)-cardinality trees fast. Zbl 1284.68660
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra
8
2009
The fractional prize-collecting Steiner tree problem on trees (extended abstract). Zbl 1266.90188
Klau, Gunnar W.; Ljubić, Ivana; Mutzel, Petra; Pferschy, Ulrich; Weiskircher, René
7
2003
An algorithmic framework for the exact solution of tree-star problems. Zbl 1403.90577
Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus
6
2017
Lagrangian decompositions for the two-level FTTx network design problem. Zbl 1296.90099
Bley, Andreas; Ljubić, Ivana; Maurer, Olaf
6
2013
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Zbl 1292.90165
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana
6
2013
The rooted maximum node-weight connected subgraph problem. Zbl 1382.90108
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Mutzel, Petra
6
2013
MIP modeling of incremental connected facility location. Zbl 1346.90478
Arulselvan, Ashwin; Bley, Andreas; Gollowitzer, Stefan; Ljubić, Ivana; Maurer, Olaf
6
2011
Modelling the hop constrained connected facility location problem on layered graphs. Zbl 1237.90132
Ljubić, Ivana; Gollowitzer, Stefan
6
2010
On the use of intersection cuts for bilevel optimization. Zbl 1406.90082
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus
5
2018
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. Zbl 1403.90481
Ljubić, Ivana; Moreno, Eduardo
5
2018
A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem. Zbl 1321.90120
Leitner, Markus; Ljubić, Ivana; Sinnl, Markus
4
2015
The recoverable robust two-level network design problem. Zbl 1327.90346
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Raghavan, S.; Toth, Paolo
4
2015
A cutting plane algorithm for the capacitated connected facility location problem. Zbl 1275.90036
Gollowitzer, Stefan; Gendron, Bernard; Ljubić, Ivana
4
2013
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice. Zbl 1198.90335
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra
4
2010
The maximum clique interdiction problem. Zbl 1430.90543
Furini, Fabio; Ljubić, Ivana; Martin, Sébastien; San Segundo, Pablo
3
2019
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design. Zbl 1349.90649
Leitner, Markus; Ljubić, Ivana; Sinnl, Markus; Werner, Axel
3
2016
On the asymmetric connected facility location polytope. Zbl 1451.90088
Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus
3
2014
Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut. Zbl 1311.90085
Bomze, Immanuel; Chimani, Markus; Jünger, Michael; Ljubić, Ivana; Mutzel, Petra; Zey, Bernd
3
2010
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. Zbl 1208.90176
Ljubić, Ivana
3
2010
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Zbl 1430.90552
San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubić, Ivana
2
2019
Decomposition methods for the two-stage stochastic Steiner tree problem. Zbl 1401.90249
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus
2
2018
The connected facility location polytope. Zbl 1376.05144
Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus
2
2018
A node-based ILP formulation for the node-weighted dominating Steiner problem. Zbl 1390.90149
Bley, Andreas; Ljubić, Ivana; Maurer, Olaf
2
2017
Stochastic survivable network design problems: theory and practice. Zbl 1394.90450
Ljubić, Ivana; Mutzel, Petra; Zey, Bernd
2
2017
A node splitting technique for two level network design problems with transition nodes. Zbl 1345.90091
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana
2
2011
Benders decomposition for very large scale partial set covering and maximal covering location problems. Zbl 1430.90372
Cordeau, Jean-François; Furini, Fabio; Ljubić, Ivana
1
2019
Solving minimum-cost shared arborescence problems. Zbl 1394.90429
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus
1
2017
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Zbl 1375.90251
Furini, Fabio; Ljubić, Ivana; Sinnl, Markus
1
2017
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. Zbl 1391.90421
Sinnl, Markus; Ljubić, Ivana
1
2016
ILP and CP formulations for the lazy bureaucrat problem. Zbl 06605761
Furini, Fabio; Ljubić, Ivana; Sinnl, Markus
1
2015
Exact approaches for solving robust prize-collecting Steiner tree problems. Zbl 1317.90300
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Toth, Paolo
1
2013
Variable neighborhood search for solving the balanced location problem. Zbl 1268.90149
Kratica, Jozef; Leitner, Markus; Ljubić, Ivana
1
2012
On the hop constrained Steiner tree problem with multiple root nodes. Zbl 1370.90216
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
1
2012
A heuristic algorithm for a prize-collecting local access network design problem. Zbl 1345.90036
Ljubić, Ivana; Putz, Peter; Salazar-González, Juan-José
1
2011
The two level network design problem with secondary hop constraints. Zbl 1345.90092
Gollowitzer, Stefan; Gouveia, Luís; Ljubić, Ivana
1
2011
Strong formulations for 2-node-connected Steiner network problems. Zbl 1168.90579
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra
1
2008
Evolutionary local search for the edge-biconnectivity augmentation problem. Zbl 1013.68070
Raidl, Günther R.; Ljubić, Ivana
1
2002
An evolutionary algorithm with stochastic hill-climbing for the edge-biconnectivity augmentation problem. Zbl 0978.68789
Ljubic, Ivana; Raidl, Günther R.
1
2001
The maximum clique interdiction problem. Zbl 1430.90543
Furini, Fabio; Ljubić, Ivana; Martin, Sébastien; San Segundo, Pablo
3
2019
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Zbl 1430.90552
San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubić, Ivana
2
2019
Benders decomposition for very large scale partial set covering and maximal covering location problems. Zbl 1430.90372
Cordeau, Jean-François; Furini, Fabio; Ljubić, Ivana
1
2019
On the use of intersection cuts for bilevel optimization. Zbl 1406.90082
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus
5
2018
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. Zbl 1403.90481
Ljubić, Ivana; Moreno, Eduardo
5
2018
Decomposition methods for the two-stage stochastic Steiner tree problem. Zbl 1401.90249
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus
2
2018
The connected facility location polytope. Zbl 1376.05144
Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus
2
2018
Thinning out Steiner trees: a node-based model for uniform edge costs. Zbl 1387.90132
Fischetti, Matteo; Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; Monaci, Michele; Resch, Max; Salvagnin, Domenico; Sinnl, Markus
24
2017
A new general-purpose algorithm for mixed-integer bilevel linear programs. Zbl 1386.90085
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus
13
2017
An algorithmic framework for the exact solution of tree-star problems. Zbl 1403.90577
Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus
6
2017
A node-based ILP formulation for the node-weighted dominating Steiner problem. Zbl 1390.90149
Bley, Andreas; Ljubić, Ivana; Maurer, Olaf
2
2017
Stochastic survivable network design problems: theory and practice. Zbl 1394.90450
Ljubić, Ivana; Mutzel, Petra; Zey, Bernd
2
2017
Solving minimum-cost shared arborescence problems. Zbl 1394.90429
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, Martin; Sinnl, Markus
1
2017
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Zbl 1375.90251
Furini, Fabio; Ljubić, Ivana; Sinnl, Markus
1
2017
Benders decomposition without separability: a computational study for capacitated facility location problems. Zbl 1346.90490
Fischetti, Matteo; Ljubić, Ivana; Sinnl, Markus
18
2016
Intersection cuts for bilevel optimization. Zbl 1419.90076
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus
8
2016
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design. Zbl 1349.90649
Leitner, Markus; Ljubić, Ivana; Sinnl, Markus; Werner, Axel
3
2016
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. Zbl 1391.90421
Sinnl, Markus; Ljubić, Ivana
1
2016
The generalized regenerator location problem. Zbl 1329.90026
Chen, Si; Ljubić, Ivana; Raghavan, S.
9
2015
The two-level diameter constrained spanning tree problem. Zbl 1309.90065
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
8
2015
A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem. Zbl 1321.90120
Leitner, Markus; Ljubić, Ivana; Sinnl, Markus
4
2015
The recoverable robust two-level network design problem. Zbl 1327.90346
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Raghavan, S.; Toth, Paolo
4
2015
ILP and CP formulations for the lazy bureaucrat problem. Zbl 06605761
Furini, Fabio; Ljubić, Ivana; Sinnl, Markus
1
2015
Hop constrained Steiner trees with multiple root nodes. Zbl 1338.90266
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
9
2014
On the asymmetric connected facility location polytope. Zbl 1451.90088
Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus
3
2014
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. Zbl 1302.90136
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Toth, Paolo
11
2013
The maximum weight connected subgraph problem. Zbl 1317.90299
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Mutzel, Petra
10
2013
Lagrangian decompositions for the two-level FTTx network design problem. Zbl 1296.90099
Bley, Andreas; Ljubić, Ivana; Maurer, Olaf
6
2013
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Zbl 1292.90165
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana
6
2013
The rooted maximum node-weight connected subgraph problem. Zbl 1382.90108
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Mutzel, Petra
6
2013
A cutting plane algorithm for the capacitated connected facility location problem. Zbl 1275.90036
Gollowitzer, Stefan; Gendron, Bernard; Ljubić, Ivana
4
2013
Exact approaches for solving robust prize-collecting Steiner tree problems. Zbl 1317.90300
Álvarez-Miranda, Eduardo; Ljubić, Ivana; Toth, Paolo
1
2013
Exact approaches to the single-source network loading problem. Zbl 1241.90018
Ljubić, Ivana; Putz, Peter; Salazar-González, Juan-José
10
2012
Variable neighborhood search for solving the balanced location problem. Zbl 1268.90149
Kratica, Jozef; Leitner, Markus; Ljubić, Ivana
1
2012
On the hop constrained Steiner tree problem with multiple root nodes. Zbl 1370.90216
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
1
2012
MIP models for connected facility location: a theoretical and computational study. Zbl 1231.90267
Gollowitzer, Stefan; Ljubić, Ivana
19
2011
MIP modeling of incremental connected facility location. Zbl 1346.90478
Arulselvan, Ashwin; Bley, Andreas; Gollowitzer, Stefan; Ljubić, Ivana; Maurer, Olaf
6
2011
A node splitting technique for two level network design problems with transition nodes. Zbl 1345.90091
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana
2
2011
A heuristic algorithm for a prize-collecting local access network design problem. Zbl 1345.90036
Ljubić, Ivana; Putz, Peter; Salazar-González, Juan-José
1
2011
The two level network design problem with secondary hop constraints. Zbl 1345.90092
Gollowitzer, Stefan; Gouveia, Luís; Ljubić, Ivana
1
2011
The regenerator location problem. Zbl 1200.90113
Chen, Si; Ljubić, Ivana; Raghavan, S.
27
2010
Modelling the hop constrained connected facility location problem on layered graphs. Zbl 1237.90132
Ljubić, Ivana; Gollowitzer, Stefan
6
2010
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice. Zbl 1198.90335
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra
4
2010
Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut. Zbl 1311.90085
Bomze, Immanuel; Chimani, Markus; Jünger, Michael; Ljubić, Ivana; Mutzel, Petra; Zey, Bernd
3
2010
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. Zbl 1208.90176
Ljubić, Ivana
3
2010
Obtaining optimal \(k\)-cardinality trees fast. Zbl 1284.68660
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra
8
2009
Strong formulations for 2-node-connected Steiner network problems. Zbl 1168.90579
Chimani, Markus; Kandyba, Maria; Ljubić, Ivana; Mutzel, Petra
1
2008
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Zbl 1085.90061
Ljubić, Ivana; Weiskircher, René; Pferschy, Ulrich; Klau, Gunnar W.; Mutzel, Petra; Fischetti, Matteo
51
2006
The fractional prize-collecting Steiner tree problem on trees (extended abstract). Zbl 1266.90188
Klau, Gunnar W.; Ljubić, Ivana; Mutzel, Petra; Pferschy, Ulrich; Weiskircher, René
7
2003
Evolutionary local search for the edge-biconnectivity augmentation problem. Zbl 1013.68070
Raidl, Günther R.; Ljubić, Ivana
1
2002
Solving the simple plant location problem by genetic algorithm. Zbl 0995.90055
Kratica, Jozef; Tošic, Dušan; Filipović, Vladimir; Ljubić, Ivana
27
2001
An evolutionary algorithm with stochastic hill-climbing for the edge-biconnectivity augmentation problem. Zbl 0978.68789
Ljubic, Ivana; Raidl, Günther R.
1
2001
all top 5

Cited by 400 Authors

34 Ljubić, Ivana
18 Leitner, Markus
18 Sinnl, Markus
12 Álvarez-Miranda, Eduardo
11 Gouveia, Luis
8 Zaks, Shmuel
7 Poss, Michael
7 Ruthmair, Mario
7 Shalom, Mordechai
6 Fischetti, Matteo
6 Furini, Fabio
6 Luipersbeck, Martin
6 Monaci, Michele
6 Raidl, Günther R.
6 Simonetti, Luidi G.
4 Cordeau, Jean-François
4 Gendron, Bernard
4 Haouari, Mohamed
4 Layeb, Safa Bhar
4 Lucena, Abilio
4 Resende, Mauricio G. C.
4 Salazar-González, Juan-José
4 Sherali, Hanif D.
3 Aneja, Yash P.
3 Buchanan, Austin
3 Chardy, Matthieu
3 Contreras, Iván A.
3 Deville, Yves
3 Flammini, Michele
3 Gollowitzer, Stefan
3 Laporte, Gilbert
3 Letchford, Adam N.
3 Li, Xiangyong
3 Miller, Sebastian J.
3 Monaco, Gianpiero
3 Moscardelli, Luca
3 Mutzel, Petra
3 Pajouh, Foad Mahdavi
3 Pham, Quang Dung
3 Uchoa, Eduardo
3 Van Hentenryck, Pascal
3 Wong, Prudence Wai-Ha
2 Akhmedov, Murodzhon
2 Angilella, Vincent
2 Arulselvan, Ashwin
2 Aydin, M. Emin
2 Balasundaram, Balabhaskar
2 Ben-Ameur, Walid
2 Beresnev, Vladimir
2 Blanco, Víctor
2 Bley, Andreas
2 Boginski, Vladimir L.
2 Candia-Véjar, Alfredo
2 Chen, Si
2 Chimani, Markus
2 Coniglio, Stefano
2 Crainic, Teodor Gabriel
2 De Boeck, Jérôme
2 de Givry, Simon
2 de Sousa, Amaro
2 DeNegre, Scott T.
2 Di Puglia Pugliese, Luigi
2 Duarte, Abraham
2 Fernández, Elena
2 Gendreau, Michel
2 Greistorfer, Peter
2 Guerriero, Francesca
2 Hill, Alessandro
2 Karasan, Oya Ekin
2 Kurtz, Jannis
2 Kwee, Ivo
2 Lodi, Andrea
2 Maculan, Nelson F.
2 Martí, Rafael
2 Martin, Sébastien
2 Melnikov, Andrey
2 Mertzios, George B.
2 Montemanni, Roberto
2 Moura, Pedro S.
2 Nasirian, Farzaneh
2 Pereira, Jordi
2 Pferschy, Ulrich
2 Putz, Peter
2 Raghavan, S. Raghu
2 Rahmaniani, Ragheb
2 Rei, Walter
2 Salles da Cunha, Alexandre
2 San Segundo, Pablo
2 Schiex, Thomas
2 Toth, Paolo
2 Voloshin, Ariella
2 Werneck, Renato F.
2 Werner, Axel
2 Yıldız, Barış
2 Zytnicki, Matthias
1 Adjiman, Claire S.
1 Adluru, Nagesh
1 Agarwal, Yogesh Kumar
1 Ahmed, Shabbir
1 Albert, Laura A.
...and 300 more Authors
all top 5

Cited in 49 Serials

45 European Journal of Operational Research
33 Computers & Operations Research
12 Mathematical Programming. Series A. Series B
11 INFORMS Journal on Computing
9 Annals of Operations Research
8 Mathematical Programming Computation
7 Discrete Applied Mathematics
7 Theoretical Computer Science
6 Networks
6 Computational Optimization and Applications
5 Journal of Global Optimization
5 Discrete Optimization
5 EURO Journal on Computational Optimization
4 Operations Research Letters
4 SIAM Journal on Optimization
4 Computational Management Science
4 Optimization Letters
3 Operations Research
3 International Transactions in Operational Research
3 Constraints
3 OR Spectrum
2 Journal of Combinatorial Optimization
1 Artificial Intelligence
1 Information Processing Letters
1 Applied Mathematics and Computation
1 Opsearch
1 International Journal of Production Research
1 Acta Mathematicae Applicatae Sinica. English Series
1 Optimization
1 Algorithmica
1 Information and Computation
1 Computational Geometry
1 Applied Mathematical Modelling
1 Automation and Remote Control
1 Communications in Statistics. Theory and Methods
1 International Journal of Computer Vision
1 Top
1 Complexity
1 Journal of Heuristics
1 Theory of Computing Systems
1 Optimization Methods & Software
1 Optimization and Engineering
1 RAIRO. Operations Research
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 4OR
1 Journal of Statistical Mechanics: Theory and Experiment
1 Networks and Spatial Economics
1 International Journal of Computational Intelligence and Applications
1 Advances in Operations Research

Citations by Year