Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ivana Ljubic
@article{DBLP:journals/eor/KuzbakovL24,
author = {Yerlan Kuzbakov and
Ivana Ljubic},
title = {New formulations for two location problems with interconnected facilities},
journal = {Eur. J. Oper. Res.},
volume = {314},
number = {1},
pages = {51--65},
year = {2024},
url = {https://doi.org/10.1016/j.ejor.2023.09.030},
doi = {10.1016/J.EJOR.2023.09.030},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KuzbakovL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-12625,
author = {Alice Calamita and
Ivana Ljubic and
Laura Palagi},
title = {Benders decomposition for congested partial set covering location
with uncertain demand},
journal = {CoRR},
volume = {abs/2401.12625},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.12625},
doi = {10.48550/ARXIV.2401.12625},
eprinttype = {arXiv},
eprint = {2401.12625},
timestamp = {Wed, 07 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-12625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LeitnerLMST23,
author = {Markus Leitner and
Ivana Ljubic and
Michele Monaci and
Markus Sinnl and
K{\"{u}}bra Taninmis},
title = {An exact method for binary fortification games},
journal = {Eur. J. Oper. Res.},
volume = {307},
number = {3},
pages = {1026--1039},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2022.10.038},
doi = {10.1016/J.EJOR.2022.10.038},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LeitnerLMST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CerulliSSAL23,
author = {Martina Cerulli and
Domenico Serra and
Carmine Sorgente and
Claudia Archetti and
Ivana Ljubic},
title = {Mathematical programming formulations for the Collapsed k-Core Problem},
journal = {Eur. J. Oper. Res.},
volume = {311},
number = {1},
pages = {56--72},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.04.038},
doi = {10.1016/J.EJOR.2023.04.038},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CerulliSSAL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BeckLS23,
author = {Yasmine Beck and
Ivana Ljubic and
Martin Schmidt},
title = {A survey on bilevel optimization under uncertainty},
journal = {Eur. J. Oper. Res.},
volume = {311},
number = {2},
pages = {401--426},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.01.008},
doi = {10.1016/J.EJOR.2023.01.008},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/BeckLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/BeckLS23,
author = {Yasmine Beck and
Ivana Ljubic and
Martin Schmidt},
title = {Exact methods for discrete {\textdollar}\{{\textbackslash}varGamma
\}{\textdollar}-robust interdiction problems with an application to
the bilevel knapsack problem},
journal = {Math. Program. Comput.},
volume = {15},
number = {4},
pages = {733--782},
year = {2023},
url = {https://doi.org/10.1007/s12532-023-00244-6},
doi = {10.1007/S12532-023-00244-6},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mpc/BeckLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MouaciGLP23,
author = {Ahlam Mouaci and
{\'{E}}ric Gourdin and
Ivana Ljubic and
Nancy Perrot},
title = {Two extended formulations for the virtual network function placement
and routing problem},
journal = {Networks},
volume = {82},
number = {1},
pages = {32--51},
year = {2023},
url = {https://doi.org/10.1002/net.22144},
doi = {10.1002/NET.22144},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MouaciGLP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/RamirezPicoLM23,
author = {Cristian Ramirez{-}Pico and
Ivana Ljubic and
Eduardo Moreno},
title = {Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs},
journal = {Transp. Sci.},
volume = {57},
number = {5},
pages = {1252--1275},
year = {2023},
url = {https://doi.org/10.1287/trsc.2022.0073},
doi = {10.1287/TRSC.2022.0073},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/RamirezPicoLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AlfandariLS22,
author = {Laurent Alfandari and
Ivana Ljubic and
Marcos de Melo da Silva},
title = {A tailored Benders decomposition approach for last-mile delivery with
autonomous robots},
journal = {Eur. J. Oper. Res.},
volume = {299},
number = {2},
pages = {510--525},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.06.048},
doi = {10.1016/J.EJOR.2021.06.048},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/AlfandariLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ArchettiL22,
author = {Claudia Archetti and
Ivana Ljubic},
title = {Comparison of formulations for the Inventory Routing Problem},
journal = {Eur. J. Oper. Res.},
volume = {303},
number = {3},
pages = {997--1008},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.12.051},
doi = {10.1016/J.EJOR.2021.12.051},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/ArchettiL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/FuriniLMP22,
author = {Fabio Furini and
Ivana Ljubic and
Enrico Malaguti and
Paolo Paronuzzi},
title = {Casting Light on the Hidden Bilevel Combinatorial Structure of the
Capacitated Vertex Separator Problem},
journal = {Oper. Res.},
volume = {70},
number = {4},
pages = {2399--2420},
year = {2022},
url = {https://doi.org/10.1287/opre.2021.2110},
doi = {10.1287/OPRE.2021.2110},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/FuriniLMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ConiglioFL22,
author = {Stefano Coniglio and
Fabio Furini and
Ivana Ljubic},
title = {Submodular maximization of concave utility functions composed with
a set-union operator with applications to maximal covering location
problems},
journal = {Math. Program.},
volume = {196},
number = {1},
pages = {9--56},
year = {2022},
url = {https://doi.org/10.1007/s10107-022-01884-7},
doi = {10.1007/S10107-022-01884-7},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ConiglioFL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/msom/FardLP22,
author = {Milad Keshvari Fard and
Ivana Ljubic and
Felix Papier},
title = {Budgeting in International Humanitarian Organizations},
journal = {Manuf. Serv. Oper. Manag.},
volume = {24},
number = {3},
pages = {1562--1577},
year = {2022},
url = {https://doi.org/10.1287/msom.2021.1016},
doi = {10.1287/MSOM.2021.1016},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/msom/FardLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/FernandezLLR22,
author = {Elena Fern{\'{a}}ndez and
Markus Leitner and
Ivana Ljubic and
Mario Ruthmair},
title = {Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent
Energy Consumption},
journal = {Transp. Sci.},
volume = {56},
number = {5},
pages = {1219--1237},
year = {2022},
url = {https://doi.org/10.1287/trsc.2022.1126},
doi = {10.1287/TRSC.2022.1126},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/FernandezLLR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icores/Ljubic22,
author = {Ivana Ljubic},
editor = {Federico Liberatore and
Greg H. Parlier and
Marc Demange},
title = {A Tailored Benders Decomposition Approach for Last-mile Delivery with
Autonomous Robots},
booktitle = {Proceedings of the 11th International Conference on Operations Research
and Enterprise Systems, {ICORES} 2022, Online Streaming, February
3-5, 2022},
pages = {9},
publisher = {{SCITEPRESS}},
year = {2022},
timestamp = {Mon, 26 Jun 2023 20:47:12 +0200},
biburl = {https://dblp.org/rec/conf/icores/Ljubic22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GaarLLST22,
author = {Elisabeth Gaar and
Jon Lee and
Ivana Ljubic and
Markus Sinnl and
K{\"{u}}bra Taninmis},
editor = {Karen I. Aardal and
Laura Sanit{\`{a}}},
title = {SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel
Programs},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International
Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13265},
pages = {262--276},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06901-7\_20},
doi = {10.1007/978-3-031-06901-7\_20},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/GaarLLST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iscopt/2022,
editor = {Ivana Ljubic and
Francisco Barahona and
Santanu S. Dey and
Ali Ridha Mahjoub},
title = {Combinatorial Optimization - 7th International Symposium, {ISCO} 2022,
Virtual Event, May 18-20, 2022, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13526},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-18530-4},
doi = {10.1007/978-3-031-18530-4},
isbn = {978-3-031-18529-8},
timestamp = {Mon, 06 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iscopt/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-00885,
author = {Yuanyuan Li and
Claudia Archetti and
Ivana Ljubic},
title = {Reinforcement Learning Approaches for the Orienteering Problem with
Stochastic and Dynamic Release Dates},
journal = {CoRR},
volume = {abs/2207.00885},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.00885},
doi = {10.48550/ARXIV.2207.00885},
eprinttype = {arXiv},
eprint = {2207.00885},
timestamp = {Wed, 06 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-00885.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-05014,
author = {Elisabeth Gaar and
Jon Lee and
Ivana Ljubic and
Markus Sinnl and
K{\"{u}}bra Taninmis},
title = {On SOCP-based disjunctive cuts for solving a class of integer bilevel
nonlinear programs},
journal = {CoRR},
volume = {abs/2207.05014},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.05014},
doi = {10.48550/ARXIV.2207.05014},
eprinttype = {arXiv},
eprint = {2207.05014},
timestamp = {Thu, 14 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-05014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LjubicMPG21,
author = {Ivana Ljubic and
Ahlam Mouaci and
Nancy Perrot and
{\'{E}}ric Gourdin},
title = {Benders decomposition for a node-capacitated Virtual Network Function
placement and routing problem},
journal = {Comput. Oper. Res.},
volume = {130},
pages = {105227},
year = {2021},
url = {https://doi.org/10.1016/j.cor.2021.105227},
doi = {10.1016/J.COR.2021.105227},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/LjubicMPG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejco/KleinertLLS21,
author = {Thomas Kleinert and
Martine Labb{\'{e}} and
Ivana Ljubic and
Martin Schmidt},
title = {A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization},
journal = {{EURO} J. Comput. Optim.},
volume = {9},
pages = {100007},
year = {2021},
url = {https://doi.org/10.1016/j.ejco.2021.100007},
doi = {10.1016/J.EJCO.2021.100007},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejco/KleinertLLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Alvarez-Miranda21,
author = {Eduardo {\'{A}}lvarez{-}Miranda and
Marcos Goycoolea and
Ivana Ljubic and
Markus Sinnl},
title = {The Generalized Reserve Set Covering Problem with Connectivity and
Buffer Requirements},
journal = {Eur. J. Oper. Res.},
volume = {289},
number = {3},
pages = {1013--1029},
year = {2021},
url = {https://doi.org/10.1016/j.ejor.2019.07.017},
doi = {10.1016/J.EJOR.2019.07.017},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/Alvarez-Miranda21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AlfandariHL21,
author = {Laurent Alfandari and
Alborz Hassanzadeh and
Ivana Ljubic},
title = {An exact method for assortment optimization under the nested logit
model},
journal = {Eur. J. Oper. Res.},
volume = {291},
number = {3},
pages = {830--845},
year = {2021},
url = {https://doi.org/10.1016/j.ejor.2020.12.007},
doi = {10.1016/J.EJOR.2020.12.007},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/AlfandariHL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/FuriniLSZ21,
author = {Fabio Furini and
Ivana Ljubic and
Pablo San Segundo and
Yanlu Zhao},
title = {A branch-and-cut algorithm for the Edge Interdiction Clique Problem},
journal = {Eur. J. Oper. Res.},
volume = {294},
number = {1},
pages = {54--69},
year = {2021},
url = {https://doi.org/10.1016/j.ejor.2021.01.030},
doi = {10.1016/J.EJOR.2021.01.030},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/FuriniLSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ljubic21,
author = {Ivana Ljubic},
title = {Solving Steiner trees: Recent advances, challenges, and perspectives},
journal = {Networks},
volume = {77},
number = {2},
pages = {177--204},
year = {2021},
url = {https://doi.org/10.1002/net.22005},
doi = {10.1002/NET.22005},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ljubic21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-06824,
author = {Elisabeth Gaar and
Jon Lee and
Ivana Ljubic and
Markus Sinnl and
K{\"{u}}bra Taninmis},
title = {SOCP-based disjunctive cuts for a class of integer nonlinear bilevel
programs},
journal = {CoRR},
volume = {abs/2111.06824},
year = {2021},
url = {https://arxiv.org/abs/2111.06824},
eprinttype = {arXiv},
eprint = {2111.06824},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-06824.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-13400,
author = {Markus Leitner and
Ivana Ljubic and
Michele Monaci and
Markus Sinnl and
K{\"{u}}bra Taninmis},
title = {An Exact Method for Fortification Games},
journal = {CoRR},
volume = {abs/2111.13400},
year = {2021},
url = {https://arxiv.org/abs/2111.13400},
eprinttype = {arXiv},
eprint = {2111.13400},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-13400.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/FuriniLT20,
author = {Fabio Furini and
Ivana Ljubic and
Emiliano Traversi},
title = {Preface: decomposition methods for hard optimization problems},
journal = {Ann. Oper. Res.},
volume = {284},
number = {2},
pages = {483--485},
year = {2020},
url = {https://doi.org/10.1007/s10479-019-03415-8},
doi = {10.1007/S10479-019-03415-8},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/FuriniLT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GouveiaLL20,
author = {Luis Gouveia and
Markus Leitner and
Ivana Ljubic},
title = {A polyhedral study of the diameter constrained minimum spanning tree
problem},
journal = {Discret. Appl. Math.},
volume = {285},
pages = {364--379},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.05.020},
doi = {10.1016/J.DAM.2020.05.020},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GouveiaLL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/FuriniLMP20,
author = {Fabio Furini and
Ivana Ljubic and
Enrico Malaguti and
Paolo Paronuzzi},
title = {On integer and bilevel formulations for the \emph{k}-vertex cut problem},
journal = {Math. Program. Comput.},
volume = {12},
number = {2},
pages = {133--164},
year = {2020},
url = {https://doi.org/10.1007/s12532-019-00167-1},
doi = {10.1007/S12532-019-00167-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mpc/FuriniLMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/BrandstatterLL20,
author = {Georg Brandst{\"{a}}tter and
Markus Leitner and
Ivana Ljubic},
title = {Location of Charging Stations in Electric Car Sharing Systems},
journal = {Transp. Sci.},
volume = {54},
number = {5},
pages = {1408--1438},
year = {2020},
url = {https://doi.org/10.1287/trsc.2019.0931},
doi = {10.1287/TRSC.2019.0931},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/BrandstatterLL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/networking/MouaciGLP20,
author = {Ahlam Mouaci and
{\'{E}}ric Gourdin and
Ivana Ljubic and
Nancy Perrot},
title = {Virtual Network Functions Placement and Routing Problem: Path formulation},
booktitle = {2020 {IFIP} Networking Conference, Networking 2020, Paris, France,
June 22-26, 2020},
pages = {55--63},
publisher = {{IEEE}},
year = {2020},
url = {https://ieeexplore.ieee.org/document/9142789},
timestamp = {Thu, 23 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/networking/MouaciGLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ArulselvanBL19,
author = {Ashwin Arulselvan and
Andreas Bley and
Ivana Ljubic},
title = {The incremental connected facility location problem},
journal = {Comput. Oper. Res.},
volume = {112},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2019.104763},
doi = {10.1016/J.COR.2019.104763},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/ArulselvanBL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CordeauFL19,
author = {Jean{-}Fran{\c{c}}ois Cordeau and
Fabio Furini and
Ivana Ljubic},
title = {Benders decomposition for very large scale partial set covering and
maximal covering location problems},
journal = {Eur. J. Oper. Res.},
volume = {275},
number = {3},
pages = {882--896},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2018.12.021},
doi = {10.1016/J.EJOR.2018.12.021},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CordeauFL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/FuriniLMS19,
author = {Fabio Furini and
Ivana Ljubic and
S{\'{e}}bastien Martin and
Pablo San Segundo},
title = {The maximum clique interdiction problem},
journal = {Eur. J. Oper. Res.},
volume = {277},
number = {1},
pages = {112--127},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2019.02.028},
doi = {10.1016/J.EJOR.2019.02.028},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/FuriniLMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/SegundoCFL19,
author = {Pablo San Segundo and
Stefano Coniglio and
Fabio Furini and
Ivana Ljubic},
title = {A new branch-and-bound algorithm for the maximum edge-weighted clique
problem},
journal = {Eur. J. Oper. Res.},
volume = {278},
number = {1},
pages = {76--90},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2019.03.047},
doi = {10.1016/J.EJOR.2019.03.047},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/SegundoCFL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LeitnerLRR19,
author = {Markus Leitner and
Ivana Ljubic and
Martin Riedler and
Mario Ruthmair},
title = {Exact Approaches for Network Design Problems with Relays},
journal = {{INFORMS} J. Comput.},
volume = {31},
number = {1},
pages = {171--192},
year = {2019},
url = {https://doi.org/10.1287/ijoc.2018.0820},
doi = {10.1287/IJOC.2018.0820},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LeitnerLRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/FischettiLMS19,
author = {Matteo Fischetti and
Ivana Ljubic and
Michele Monaci and
Markus Sinnl},
title = {Interdiction Games and Monotonicity, with Application to Knapsack
Problems},
journal = {{INFORMS} J. Comput.},
volume = {31},
number = {2},
pages = {390--410},
year = {2019},
url = {https://doi.org/10.1287/ijoc.2018.0831},
doi = {10.1287/IJOC.2018.0831},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/FischettiLMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/LeitnerLLS18,
author = {Markus Leitner and
Ivana Ljubic and
Martin Luipersbeck and
Markus Sinnl},
title = {Decomposition methods for the two-stage stochastic Steiner tree problem},
journal = {Comput. Optim. Appl.},
volume = {69},
number = {3},
pages = {713--752},
year = {2018},
url = {https://doi.org/10.1007/s10589-017-9966-x},
doi = {10.1007/S10589-017-9966-X},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/LeitnerLLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeitnerLGS18,
author = {Markus Leitner and
Ivana Ljubic and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez and
Markus Sinnl},
title = {The connected facility location polytope},
journal = {Discret. Appl. Math.},
volume = {234},
pages = {151--167},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2016.08.010},
doi = {10.1016/J.DAM.2016.08.010},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LeitnerLGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LjubicM18,
author = {Ivana Ljubic and
Eduardo Moreno},
title = {Outer approximation and submodular cuts for maximum capture facility
location problems with random utilities},
journal = {Eur. J. Oper. Res.},
volume = {266},
number = {1},
pages = {46--56},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2017.09.023},
doi = {10.1016/J.EJOR.2017.09.023},
timestamp = {Wed, 04 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LjubicM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LeitnerLLS18,
author = {Markus Leitner and
Ivana Ljubic and
Martin Luipersbeck and
Markus Sinnl},
title = {A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting
Steiner Tree and Related Problems},
journal = {{INFORMS} J. Comput.},
volume = {30},
number = {2},
pages = {402--420},
year = {2018},
url = {https://doi.org/10.1287/ijoc.2017.0788},
doi = {10.1287/IJOC.2017.0788},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LeitnerLLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FischettiLMS18,
author = {Matteo Fischetti and
Ivana Ljubic and
Michele Monaci and
Markus Sinnl},
title = {On the use of intersection cuts for bilevel optimization},
journal = {Math. Program.},
volume = {172},
number = {1-2},
pages = {77--103},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1189-5},
doi = {10.1007/S10107-017-1189-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FischettiLMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LjubicMZ17,
author = {Ivana Ljubic and
Petra Mutzel and
Bernd Zey},
title = {Stochastic survivable network design problems: Theory and practice},
journal = {Eur. J. Oper. Res.},
volume = {256},
number = {2},
pages = {333--348},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2016.06.048},
doi = {10.1016/J.EJOR.2016.06.048},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LjubicMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Alvarez-Miranda17,
author = {Eduardo {\'{A}}lvarez{-}Miranda and
Ivana Ljubic and
Martin Luipersbeck and
Markus Sinnl},
title = {Solving minimum-cost shared arborescence problems},
journal = {Eur. J. Oper. Res.},
volume = {258},
number = {3},
pages = {887--901},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2016.11.004},
doi = {10.1016/J.EJOR.2016.11.004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/Alvarez-Miranda17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/EhrgottLP17,
author = {Matthias Ehrgott and
Ivana Ljubic and
Sophie N. Parragh},
title = {Feature cluster: Recent advances in exact methods for multi-objective
optimisation},
journal = {Eur. J. Oper. Res.},
volume = {260},
number = {3},
pages = {805--806},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2017.02.004},
doi = {10.1016/J.EJOR.2017.02.004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/EhrgottLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LeitnerLGS17,
author = {Markus Leitner and
Ivana Ljubic and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez and
Markus Sinnl},
title = {An algorithmic framework for the exact solution of tree-star problems},
journal = {Eur. J. Oper. Res.},
volume = {261},
number = {1},
pages = {54--66},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2017.02.011},
doi = {10.1016/J.EJOR.2017.02.011},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LeitnerLGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/FuriniLS17,
author = {Fabio Furini and
Ivana Ljubic and
Markus Sinnl},
title = {An effective dynamic programming algorithm for the minimum-cost maximal
knapsack packing problem},
journal = {Eur. J. Oper. Res.},
volume = {262},
number = {2},
pages = {438--448},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2017.03.061},
doi = {10.1016/J.EJOR.2017.03.061},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/FuriniLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/FischettiLMS17,
author = {Matteo Fischetti and
Ivana Ljubic and
Michele Monaci and
Markus Sinnl},
title = {A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs},
journal = {Oper. Res.},
volume = {65},
number = {6},
pages = {1615--1637},
year = {2017},
url = {https://doi.org/10.1287/opre.2017.1650},
doi = {10.1287/OPRE.2017.1650},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/FischettiLMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/FischettiLS17,
author = {Matteo Fischetti and
Ivana Ljubic and
Markus Sinnl},
title = {Redesigning Benders Decomposition for Large-Scale Facility Location},
journal = {Manag. Sci.},
volume = {63},
number = {7},
pages = {2146--2162},
year = {2017},
url = {https://doi.org/10.1287/mnsc.2016.2461},
doi = {10.1287/MNSC.2016.2461},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/FischettiLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/FischettiLLLMRS17,
author = {Matteo Fischetti and
Markus Leitner and
Ivana Ljubic and
Martin Luipersbeck and
Michele Monaci and
Max Resch and
Domenico Salvagnin and
Markus Sinnl},
title = {Thinning out Steiner trees: a node-based model for uniform edge costs},
journal = {Math. Program. Comput.},
volume = {9},
number = {2},
pages = {203--229},
year = {2017},
url = {https://doi.org/10.1007/s12532-016-0111-0},
doi = {10.1007/S12532-016-0111-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/FischettiLLLMRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BleyLM17,
author = {Andreas Bley and
Ivana Ljubic and
Olaf Maurer},
title = {A node-based {ILP} formulation for the node-weighted dominating Steiner
problem},
journal = {Networks},
volume = {69},
number = {1},
pages = {33--51},
year = {2017},
url = {https://doi.org/10.1002/net.21722},
doi = {10.1002/NET.21722},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BleyLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/or/2015,
editor = {Karl F. Doerner and
Ivana Ljubic and
Georg Pflug and
Gernot Tragler},
title = {Operations Research Proceedings 2015, Selected Papers of the International
Conference of the German, Austrian and Swiss Operations Research Societies
(GOR, {\"{O}}GOR, SVOR/ASRO), University of Vienna, Austria,
September 1-4, 2015},
series = {Operations Research Proceedings},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-42902-1},
doi = {10.1007/978-3-319-42902-1},
isbn = {978-3-319-42901-4},
timestamp = {Tue, 02 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/or/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LeitnerLSW16,
author = {Markus Leitner and
Ivana Ljubic and
Markus Sinnl and
Axel Werner},
title = {{ILP} heuristics and a new exact method for bi-objective 0/1 ILPs:
Application to FTTx-network design},
journal = {Comput. Oper. Res.},
volume = {72},
pages = {128--146},
year = {2016},
url = {https://doi.org/10.1016/j.cor.2016.02.006},
doi = {10.1016/J.COR.2016.02.006},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/LeitnerLSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/FischettiLS16,
author = {Matteo Fischetti and
Ivana Ljubic and
Markus Sinnl},
title = {Benders decomposition without separability: {A} computational study
for capacitated facility location problems},
journal = {Eur. J. Oper. Res.},
volume = {253},
number = {3},
pages = {557--569},
year = {2016},
url = {https://doi.org/10.1016/j.ejor.2016.03.002},
doi = {10.1016/J.EJOR.2016.03.002},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/FischettiLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/SinnlL16,
author = {Markus Sinnl and
Ivana Ljubic},
title = {A node-based layered graph approach for the Steiner tree problem with
revenues, budget and hop-constraints},
journal = {Math. Program. Comput.},
volume = {8},
number = {4},
pages = {461--490},
year = {2016},
url = {https://doi.org/10.1007/s12532-016-0102-1},
doi = {10.1007/S12532-016-0102-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/SinnlL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FischettiLMS16,
author = {Matteo Fischetti and
Ivana Ljubic and
Michele Monaci and
Markus Sinnl},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Intersection Cuts for Bilevel Optimization},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {77--88},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_7},
doi = {10.1007/978-3-319-33461-5\_7},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/FischettiLMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/Alvarez-MirandaLRT15,
author = {Eduardo {\'{A}}lvarez{-}Miranda and
Ivana Ljubic and
S. Raghavan and
Paolo Toth},
title = {The Recoverable Robust Two-Level Network Design Problem},
journal = {{INFORMS} J. Comput.},
volume = {27},
number = {1},
pages = {1--19},
year = {2015},
url = {https://doi.org/10.1287/ijoc.2014.0606},
doi = {10.1287/IJOC.2014.0606},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/informs/Alvarez-MirandaLRT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LeitnerLS15,
author = {Markus Leitner and
Ivana Ljubic and
Markus Sinnl},
title = {A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting
Steiner Tree Problem},
journal = {{INFORMS} J. Comput.},
volume = {27},
number = {1},
pages = {118--134},
year = {2015},
url = {https://doi.org/10.1287/ijoc.2014.0614},
doi = {10.1287/IJOC.2014.0614},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/informs/LeitnerLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/ChenLR15,
author = {Si Chen and
Ivana Ljubic and
S. Raghavan},
title = {The Generalized Regenerator Location Problem},
journal = {{INFORMS} J. Comput.},
volume = {27},
number = {2},
pages = {204--220},
year = {2015},
url = {https://doi.org/10.1287/ijoc.2014.0621},
doi = {10.1287/IJOC.2014.0621},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/informs/ChenLR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GouveiaLL15,
author = {Luis Eduardo Neves Gouveia and
Markus Leitner and
Ivana Ljubic},
title = {The two-level diameter constrained spanning tree problem},
journal = {Math. Program.},
volume = {150},
number = {1},
pages = {49--78},
year = {2015},
url = {https://doi.org/10.1007/s10107-013-0743-z},
doi = {10.1007/S10107-013-0743-Z},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/GouveiaLL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/FuriniLS15,
author = {Fabio Furini and
Ivana Ljubic and
Markus Sinnl},
editor = {Laurent Michel},
title = {{ILP} and {CP} Formulations for the Lazy Bureaucrat Problem},
booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
- 12th International Conference, {CPAIOR} 2015, Barcelona, Spain,
May 18-22, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9075},
pages = {255--270},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18008-3\_18},
doi = {10.1007/978-3-319-18008-3\_18},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/FuriniLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LjubicPG14,
author = {Ivana Ljubic and
Peter Putz and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {A MIP-based approach to solve the prize-collecting local access network
design problem},
journal = {Eur. J. Oper. Res.},
volume = {235},
number = {3},
pages = {727--739},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2013.11.003},
doi = {10.1016/J.EJOR.2013.11.003},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LjubicPG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GouveiaLL14,
author = {Luis Eduardo Neves Gouveia and
Markus Leitner and
Ivana Ljubic},
title = {Hop constrained Steiner trees with multiple root nodes},
journal = {Eur. J. Oper. Res.},
volume = {236},
number = {1},
pages = {100--112},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2013.11.029},
doi = {10.1016/J.EJOR.2013.11.029},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/GouveiaLL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hm/LeitnerLLR14,
author = {Markus Leitner and
Ivana Ljubic and
Martin Luipersbeck and
Max Resch},
editor = {Maria J. Blesa and
Christian Blum and
Stefan Vo{\ss}},
title = {A Partition-Based Heuristic for the Steiner Tree Problem in Large
Graphs},
booktitle = {Hybrid Metaheuristics - 9th International Workshop, {HM} 2014, Hamburg,
Germany, June 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8457},
pages = {56--70},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07644-7\_5},
doi = {10.1007/978-3-319-07644-7\_5},
timestamp = {Thu, 29 Feb 2024 15:50:30 +0100},
biburl = {https://dblp.org/rec/conf/hm/LeitnerLLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/LeitnerLGS14,
author = {Markus Leitner and
Ivana Ljubic and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez and
Markus Sinnl},
editor = {Pierre Fouilhoux and
Luis Eduardo Neves Gouveia and
Ali Ridha Mahjoub and
Vangelis Th. Paschos},
title = {On the Asymmetric Connected Facility Location Polytope},
booktitle = {Combinatorial Optimization - Third International Symposium, {ISCO}
2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8596},
pages = {371--383},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09174-7\_32},
doi = {10.1007/978-3-319-09174-7\_32},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/LeitnerLGS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/Alvarez-MirandaLT13,
author = {Eduardo {\'{A}}lvarez{-}Miranda and
Ivana Ljubic and
Paolo Toth},
title = {A note on the Bertsimas {\&} Sim algorithm for robust combinatorial
optimization problems},
journal = {4OR},
volume = {11},
number = {4},
pages = {349--360},
year = {2013},
url = {https://doi.org/10.1007/s10288-013-0231-6},
doi = {10.1007/S10288-013-0231-6},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/Alvarez-MirandaLT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/GollowitzerGL13,
author = {Stefan Gollowitzer and
Bernard Gendron and
Ivana Ljubic},
title = {A cutting plane algorithm for the Capacitated Connected Facility Location
Problem},
journal = {Comput. Optim. Appl.},
volume = {55},
number = {3},
pages = {647--674},
year = {2013},
url = {https://doi.org/10.1007/s10589-013-9544-9},
doi = {10.1007/S10589-013-9544-9},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/GollowitzerGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejco/BleyLM13,
author = {Andreas Bley and
Ivana Ljubic and
Olaf Maurer},
title = {Lagrangian decompositions for the two-level FTTx network design problem},
journal = {{EURO} J. Comput. Optim.},
volume = {1},
number = {3-4},
pages = {221--252},
year = {2013},
url = {https://doi.org/10.1007/s13675-013-0014-z},
doi = {10.1007/S13675-013-0014-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejco/BleyLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LeitnerLS13,
author = {Markus Leitner and
Ivana Ljubic and
Markus Sinnl},
title = {Solving the bi-objective prize-collecting Steiner tree problem with
the {\unicode{1013}}-constraint method},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {181--188},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.091},
doi = {10.1016/J.ENDM.2013.05.091},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LeitnerLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LjubicMZ13,
author = {Ivana Ljubic and
Petra Mutzel and
Bernd Zey},
title = {Stochastic Survivable Network Design Problems},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {245--252},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.099},
doi = {10.1016/J.ENDM.2013.05.099},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/LjubicMZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LeitnerLSW13,
author = {Markus Leitner and
Ivana Ljubic and
Markus Sinnl and
Axel Werner},
title = {On the Two-Architecture Connected Facility Location Problem},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {359--366},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.113},
doi = {10.1016/J.ENDM.2013.05.113},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LeitnerLSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GollowitzerGL13,
author = {Stefan Gollowitzer and
Luis Eduardo Neves Gouveia and
Ivana Ljubic},
title = {Enhanced formulations and branch-and-cut for the two level network
design problem with transition facilities},
journal = {Eur. J. Oper. Res.},
volume = {225},
number = {2},
pages = {211--222},
year = {2013},
url = {https://doi.org/10.1016/j.ejor.2012.09.040},
doi = {10.1016/J.EJOR.2012.09.040},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/GollowitzerGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Alvarez-MirandaLT13,
author = {Eduardo {\'{A}}lvarez{-}Miranda and
Ivana Ljubic and
Paolo Toth},
title = {Exact approaches for solving robust prize-collecting Steiner tree
problems},
journal = {Eur. J. Oper. Res.},
volume = {229},
number = {3},
pages = {599--612},
year = {2013},
url = {https://doi.org/10.1016/j.ejor.2013.03.037},
doi = {10.1016/J.EJOR.2013.03.037},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Alvarez-MirandaLT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LjubicG13,
author = {Ivana Ljubic and
Stefan Gollowitzer},
title = {Layered Graph Approaches to the Hop Constrained Connected Facility
Location Problem},
journal = {{INFORMS} J. Comput.},
volume = {25},
number = {2},
pages = {256--270},
year = {2013},
url = {https://doi.org/10.1287/ijoc.1120.0500},
doi = {10.1287/IJOC.1120.0500},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LjubicG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/Alvarez-MirandaLM13,
author = {Eduardo {\'{A}}lvarez{-}Miranda and
Ivana Ljubic and
Petra Mutzel},
editor = {Carla P. Gomes and
Meinolf Sellmann},
title = {The Rooted Maximum Node-Weight Connected Subgraph Problem},
booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
for Combinatorial Optimization Problems, 10th International Conference,
{CPAIOR} 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7874},
pages = {300--315},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38171-3\_20},
doi = {10.1007/978-3-642-38171-3\_20},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/Alvarez-MirandaLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KraticaLL12,
author = {Jozef Kratica and
Markus Leitner and
Ivana Ljubic},
title = {Variable Neighborhood Search for Solving the Balanced Location Problem},
journal = {Electron. Notes Discret. Math.},
volume = {39},
pages = {21--28},
year = {2012},
url = {https://doi.org/10.1016/j.endm.2012.10.004},
doi = {10.1016/J.ENDM.2012.10.004},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KraticaLL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LjubicPG12,
author = {Ivana Ljubic and
Peter Putz and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {Exact approaches to the single-source network loading problem},
journal = {Networks},
volume = {59},
number = {1},
pages = {89--106},
year = {2012},
url = {https://doi.org/10.1002/net.20481},
doi = {10.1002/NET.20481},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LjubicPG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/GouveiaLL12,
author = {Luis Eduardo Neves Gouveia and
Markus Leitner and
Ivana Ljubic},
editor = {Ali Ridha Mahjoub and
Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes},
booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO}
2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7422},
pages = {201--212},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32147-4\_19},
doi = {10.1007/978-3-642-32147-4\_19},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/GouveiaLL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/GollowitzerL11,
author = {Stefan Gollowitzer and
Ivana Ljubic},
title = {{MIP} models for connected facility location: {A} theoretical and
computational study},
journal = {Comput. Oper. Res.},
volume = {38},
number = {2},
pages = {435--449},
year = {2011},
url = {https://doi.org/10.1016/j.cor.2010.07.002},
doi = {10.1016/J.COR.2010.07.002},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/GollowitzerL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icumt/Alvarez-MirandaLT11,
author = {Eduardo {\'{A}}lvarez{-}Miranda and
Ivana Ljubic and
Paolo Toth},
title = {Exact solutions for the robust prize-collecting steiner tree problem},
booktitle = {3rd International Congress on Ultra Modern Telecommunications and
Control Systems and Workshops, {ICUMT} 2011, Budapest, Hungary, October
5-7, 2011},
pages = {1--7},
publisher = {{IEEE}},
year = {2011},
url = {https://ieeexplore.ieee.org/document/6078848/},
timestamp = {Tue, 10 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icumt/Alvarez-MirandaLT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/inoc/GollowitzerGL11,
author = {Stefan Gollowitzer and
Luis Eduardo Neves Gouveia and
Ivana Ljubic},
editor = {Julia Pahl and
Torsten Reiners and
Stefan Vo{\ss}},
title = {A Node Splitting Technique for Two Level Network Design Problems with
Transition Nodes},
booktitle = {Network Optimization - 5th International Conference, {INOC} 2011,
Hamburg, Germany, June 13-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6701},
pages = {57--70},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21527-8\_8},
doi = {10.1007/978-3-642-21527-8\_8},
timestamp = {Fri, 16 Feb 2024 11:29:47 +0100},
biburl = {https://dblp.org/rec/conf/inoc/GollowitzerGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/inoc/GollowitzerGL11a,
author = {Stefan Gollowitzer and
Luis Eduardo Neves Gouveia and
Ivana Ljubic},
editor = {Julia Pahl and
Torsten Reiners and
Stefan Vo{\ss}},
title = {The Two Level Network Design Problem with Secondary Hop Constraints},
booktitle = {Network Optimization - 5th International Conference, {INOC} 2011,
Hamburg, Germany, June 13-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6701},
pages = {71--76},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21527-8\_9},
doi = {10.1007/978-3-642-21527-8\_9},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/inoc/GollowitzerGL11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/inoc/LjubicPG11,
author = {Ivana Ljubic and
Peter Putz and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
editor = {Julia Pahl and
Torsten Reiners and
Stefan Vo{\ss}},
title = {A Heuristic Algorithm for a Prize-Collecting Local Access Network
Design Problem},
booktitle = {Network Optimization - 5th International Conference, {INOC} 2011,
Hamburg, Germany, June 13-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6701},
pages = {139--144},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21527-8\_17},
doi = {10.1007/978-3-642-21527-8\_17},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/inoc/LjubicPG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/inoc/ArulselvanBGLM11,
author = {Ashwin Arulselvan and
Andreas Bley and
Stefan Gollowitzer and
Ivana Ljubic and
Olaf Maurer},
editor = {Julia Pahl and
Torsten Reiners and
Stefan Vo{\ss}},
title = {{MIP} Modeling of Incremental Connected Facility Location},
booktitle = {Network Optimization - 5th International Conference, {INOC} 2011,
Hamburg, Germany, June 13-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6701},
pages = {490--502},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21527-8\_54},
doi = {10.1007/978-3-642-21527-8\_54},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/inoc/ArulselvanBGLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LjubicG10,
author = {Ivana Ljubic and
Stefan Gollowitzer},
title = {Modelling the Hop Constrained Connected Facility Location Problem
on Layered Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {36},
pages = {207--214},
year = {2010},
url = {https://doi.org/10.1016/j.endm.2010.05.027},
doi = {10.1016/J.ENDM.2010.05.027},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LjubicG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChimaniKLM10,
author = {Markus Chimani and
Maria Kandyba and
Ivana Ljubic and
Petra Mutzel},
title = {Orientation-based models for \{0, 1, 2\}-survivable network design:
theory and practice},
journal = {Math. Program.},
volume = {124},
number = {1-2},
pages = {413--439},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0375-5},
doi = {10.1007/S10107-010-0375-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ChimaniKLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChenLR10,
author = {Si Chen and
Ivana Ljubic and
S. Raghavan},
title = {The regenerator location problem},
journal = {Networks},
volume = {55},
number = {3},
pages = {205--220},
year = {2010},
url = {https://doi.org/10.1002/net.20366},
doi = {10.1002/NET.20366},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChenLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Ljubic10,
author = {Ivana Ljubic},
title = {A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation},
journal = {Networks},
volume = {56},
number = {3},
pages = {169--182},
year = {2010},
url = {https://doi.org/10.1002/net.20358},
doi = {10.1002/NET.20358},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Ljubic10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BomzeCJLMZ10,
author = {Immanuel M. Bomze and
Markus Chimani and
Michael J{\"{u}}nger and
Ivana Ljubic and
Petra Mutzel and
Bernd Zey},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {427--439},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_38},
doi = {10.1007/978-3-642-17517-6\_38},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BomzeCJLMZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChimaniKLM09,
author = {Markus Chimani and
Maria Kandyba and
Ivana Ljubic and
Petra Mutzel},
title = {Obtaining optimal \emph{k}-cardinality trees fast},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537600},
doi = {10.1145/1498698.1537600},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ChimaniKLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/ChimaniKLM08,
author = {Markus Chimani and
Maria Kandyba and
Ivana Ljubic and
Petra Mutzel},
editor = {J. Ian Munro and
Dorothea Wagner},
title = {Obtaining Optimal k-Cardinality Trees Fast},
booktitle = {Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments,
{ALENEX} 2008, San Francisco, California, USA, January 19, 2008},
pages = {27--36},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972887.3},
doi = {10.1137/1.9781611972887.3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/ChimaniKLM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ChimaniKLM08,
author = {Markus Chimani and
Maria Kandyba and
Ivana Ljubic and
Petra Mutzel},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Strong Formulations for 2-Node-Connected Steiner Network Problems},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {190--200},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_18},
doi = {10.1007/978-3-540-85097-7\_18},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ChimaniKLM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/saint/TomazicL08,
author = {Alessandro Tomazic and
Ivana Ljubic},
title = {A {GRASP} Algorithm for the Connected Facility Location Problem},
booktitle = {Proceedings of the 2008 International Symposium on Applications and
the Internet, {SAINT} 2008, 28 July - 1 August 2008, Turku, Finland},
pages = {257--260},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/SAINT.2008.64},
doi = {10.1109/SAINT.2008.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/saint/TomazicL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hm/Ljubic07,
author = {Ivana Ljubic},
editor = {Thomas Bartz{-}Beielstein and
Mar{\'{\i}}a J. Blesa Aguilera and
Christian Blum and
Boris Naujoks and
Andrea Roli and
G{\"{u}}nter Rudolph and
Michael Sampels},
title = {A Hybrid {VNS} for Connected Facility Location},
booktitle = {Hybrid Metaheuristics, 4th International Workshop, {HM} 2007, Dortmund,
Germany, October 8-9, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4771},
pages = {157--169},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75514-2\_12},
doi = {10.1007/978-3-540-75514-2\_12},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/hm/Ljubic07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LjubicWPKMF06,
author = {Ivana Ljubic and
Ren{\'{e}} Weiskircher and
Ulrich Pferschy and
Gunnar W. Klau and
Petra Mutzel and
Matteo Fischetti},
title = {An Algorithmic Framework for the Exact Solution of the Prize-Collecting
Steiner Tree Problem},
journal = {Math. Program.},
volume = {105},
number = {2-3},
pages = {427--449},
year = {2006},
url = {https://doi.org/10.1007/s10107-005-0660-x},
doi = {10.1007/S10107-005-0660-X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LjubicWPKMF06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/LjubicWPKMF05,
author = {Ivana Ljubic and
Ren{\'{e}} Weiskircher and
Ulrich Pferschy and
Gunnar W. Klau and
Petra Mutzel and
Matteo Fischetti},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Solving the Prize-Collecting Steiner Tree Problem to Optimality},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {68--76},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/06iljubic.pdf},
timestamp = {Tue, 30 Jan 2007 13:47:28 +0100},
biburl = {https://dblp.org/rec/conf/alenex/LjubicWPKMF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/KlauLMMNPRW04,
author = {Gunnar W. Klau and
Ivana Ljubic and
Andreas Moser and
Petra Mutzel and
Philipp Neuner and
Ulrich Pferschy and
G{\"{u}}nther R. Raidl and
Ren{\'{e}} Weiskircher},
editor = {Kalyanmoy Deb and
Riccardo Poli and
Wolfgang Banzhaf and
Hans{-}Georg Beyer and
Edmund K. Burke and
Paul J. Darwen and
Dipankar Dasgupta and
Dario Floreano and
James A. Foster and
Mark Harman and
Owen Holland and
Pier Luca Lanzi and
Lee Spector and
Andrea Tettamanzi and
Dirk Thierens and
Andrew M. Tyrrell},
title = {Combining a Memetic Algorithm with Integer Programming to Solve the
Prize-Collecting Steiner Tree Problem},
booktitle = {Genetic and Evolutionary Computation - {GECCO} 2004, Genetic and Evolutionary
Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {3102},
pages = {1304--1315},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24854-5\_125},
doi = {10.1007/978-3-540-24854-5\_125},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/KlauLMMNPRW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/LjubieR03,
author = {Ivana Ljubic and
G{\"{u}}nther R. Raidl},
title = {A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation
of Graphs},
journal = {J. Heuristics},
volume = {9},
number = {5},
pages = {401--427},
year = {2003},
url = {https://doi.org/10.1023/B:HEUR.0000004810.27436.30},
doi = {10.1023/B:HEUR.0000004810.27436.30},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/LjubieR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KlauLMPW03,
author = {Gunnar W. Klau and
Ivana Ljubic and
Petra Mutzel and
Ulrich Pferschy and
Ren{\'{e}} Weiskircher},
editor = {Giuseppe Di Battista and
Uri Zwick},
title = {The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended
Abstract},
booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
Hungary, September 16-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2832},
pages = {691--702},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39658-1\_62},
doi = {10.1007/978-3-540-39658-1\_62},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/KlauLMPW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/evoW/KraticaLT03,
author = {Jozef Kratica and
Ivana Ljubic and
Dusan Tosic},
editor = {G{\"{u}}nther R. Raidl and
Jean{-}Arcady Meyer and
Martin Middendorf and
Stefano Cagnoni and
Juan J. Romero Cardalda and
David Corne and
Jens Gottlieb and
Agn{\`{e}}s Guillot and
Emma Hart and
Colin G. Johnson and
Elena Marchiori},
title = {A Genetic Algorithm for the Index Selection Problem},
booktitle = {Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO,
EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April
14-16, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2611},
pages = {280--290},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36605-9\_26},
doi = {10.1007/3-540-36605-9\_26},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/evoW/KraticaLT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RaidlL02,
author = {G{\"{u}}nther R. Raidl and
Ivana Ljubic},
title = {Evolutionary local search for the edge-biconnectivity augmentation
problem},
journal = {Inf. Process. Lett.},
volume = {82},
number = {1},
pages = {39--45},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00285-X},
doi = {10.1016/S0020-0190(01)00285-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RaidlL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/evoW/KerstingRL02,
author = {Sandor Kersting and
G{\"{u}}nther R. Raidl and
Ivana Ljubic},
editor = {Stefano Cagnoni and
Jens Gottlieb and
Emma Hart and
Martin Middendorf and
G{\"{u}}nther R. Raidl},
title = {A Memetic Algorithm for Vertex-Biconnectivity Augmentation},
booktitle = {Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP,
EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2279},
pages = {102--111},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-46004-7\_11},
doi = {10.1007/3-540-46004-7\_11},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/evoW/KerstingRL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/KraticaTFL01,
author = {Jozef Kratica and
Dusan Tosic and
Vladimir Filipovic and
Ivana Ljubic},
title = {Solving the simple plant location problem by genetic algorithm},
journal = {{RAIRO} Oper. Res.},
volume = {35},
number = {1},
pages = {127--142},
year = {2001},
url = {https://doi.org/10.1051/ro:2001107},
doi = {10.1051/RO:2001107},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/KraticaTFL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/evoW/LjubicR01,
author = {Ivana Ljubic and
G{\"{u}}nther R. Raidl},
editor = {Egbert J. W. Boers and
Jens Gottlieb and
Pier Luca Lanzi and
Robert E. Smith and
Stefano Cagnoni and
Emma Hart and
G{\"{u}}nther R. Raidl and
H. Tijink},
title = {An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity
Augmentation Problem},
booktitle = {Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP,
EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2037},
pages = {20--29},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45365-2\_3},
doi = {10.1007/3-540-45365-2\_3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/evoW/LjubicR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cec/LjubicK00,
author = {Ivana D. Ljubic and
Jozef J. Kratica},
editor = {Ali M. S. Zalzala},
title = {A genetic algorithm for the biconnectivity augmentation problem},
booktitle = {Proceedings of the 2000 Congress on Evolutionary Computation, {CEC}
2000, La Jolla, CA, USA, July 16-19, 2000},
pages = {89--96},
publisher = {{IEEE}},
year = {2000},
url = {https://doi.org/10.1109/CEC.2000.870280},
doi = {10.1109/CEC.2000.870280},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cec/LjubicK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/LjubicRK00,
author = {Ivana Ljubic and
G{\"{u}}nther R. Raidl and
Jozef Kratica},
editor = {Marc Schoenauer and
Kalyanmoy Deb and
G{\"{u}}nter Rudolph and
Xin Yao and
Evelyne Lutton and
Juan Juli{\'{a}}n Merelo Guerv{\'{o}}s and
Hans{-}Paul Schwefel},
title = {A Hybrid {GA} for the Edge-Biconnectivity Augmentation Problem},
booktitle = {Parallel Problem Solving from Nature - {PPSN} VI, 6th International
Conference, Paris, France, September 18-20, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1917},
pages = {641--650},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45356-3\_63},
doi = {10.1007/3-540-45356-3\_63},
timestamp = {Sun, 25 Jul 2021 11:46:24 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/LjubicRK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 01:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
