Ivana Ljubic
Orcid: 0000-0002-4834-6284Affiliations:
- ESSEC Business School, Paris, France
- University of Vienna, Austria (former)
- Vienna University of Technology, Austria (former, 2004)
According to our database1,
Ivana Ljubic
authored at least 107 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on twitter.com
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
Math. Program., July, 2024
Eur. J. Oper. Res., April, 2024
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates.
Transp. Sci., 2024
Transp. Sci., 2024
Eur. J. Oper. Res., 2024
Benders decomposition for congested partial set covering location with uncertain demand.
CoRR, 2024
2023
Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem.
Math. Program. Comput., December, 2023
Eur. J. Oper. Res., December, 2023
Eur. J. Oper. Res., November, 2023
Transp. Sci., September, 2023
Two extended formulations for the virtual network function placement and routing problem.
Networks, July, 2023
2022
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.
Transp. Sci., 2022
Manuf. Serv. Oper. Manag., 2022
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems.
Math. Program., 2022
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem.
Oper. Res., 2022
Eur. J. Oper. Res., 2022
A tailored Benders decomposition approach for last-mile delivery with autonomous robots.
Eur. J. Oper. Res., 2022
Proceedings of the Integer Programming and Combinatorial Optimization, 2022
A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022
2021
Eur. J. Oper. Res., 2021
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.
Eur. J. Oper. Res., 2021
Eur. J. Oper. Res., 2021
EURO J. Comput. Optim., 2021
Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem.
Comput. Oper. Res., 2021
2020
Math. Program. Comput., 2020
Discret. Appl. Math., 2020
Proceedings of the 2020 IFIP Networking Conference, 2020
2019
INFORMS J. Comput., 2019
Eur. J. Oper. Res., 2019
Benders decomposition for very large scale partial set covering and maximal covering location problems.
Eur. J. Oper. Res., 2019
2018
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.
INFORMS J. Comput., 2018
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities.
Eur. J. Oper. Res., 2018
Comput. Optim. Appl., 2018
2017
Networks, 2017
Math. Program. Comput., 2017
Manag. Sci., 2017
Oper. Res., 2017
Eur. J. Oper. Res., 2017
Eur. J. Oper. Res., 2017
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.
Eur. J. Oper. Res., 2017
Eur. J. Oper. Res., 2017
2016
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints.
Math. Program. Comput., 2016
Benders decomposition without separability: A computational study for capacitated facility location problems.
Eur. J. Oper. Res., 2016
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design.
Comput. Oper. Res., 2016
Proceedings of the Integer Programming and Combinatorial Optimization, 2016
2015
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.
INFORMS J. Comput., 2015
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015
2014
A MIP-based approach to solve the prize-collecting local access network design problem.
Eur. J. Oper. Res., 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014
2013
INFORMS J. Comput., 2013
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities.
Eur. J. Oper. Res., 2013
Eur. J. Oper. Res., 2013
Electron. Notes Discret. Math., 2013
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.
Electron. Notes Discret. Math., 2013
EURO J. Comput. Optim., 2013
Comput. Optim. Appl., 2013
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems.
4OR, 2013
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013
2012
Electron. Notes Discret. Math., 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
Comput. Oper. Res., 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.
Proceedings of the Network Optimization - 5th International Conference, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
2010
Networks, 2010
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice.
Math. Program., 2010
Electron. Notes Discret. Math., 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
2009
2008
Proceedings of the 2008 International Symposium on Applications and the Internet, 2008
Proceedings of the Combinatorial Optimization and Applications, 2008
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008
2007
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007
2006
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.
Math. Program., 2006
2005
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005
2004
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.
Proceedings of the Genetic and Evolutionary Computation, 2004
2003
J. Heuristics, 2003
Proceedings of the Applications of Evolutionary Computing, 2003
Proceedings of the Algorithms, 2003
2002
Inf. Process. Lett., 2002
Proceedings of the Applications of Evolutionary Computing, 2002
2001
RAIRO Oper. Res., 2001
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem.
Proceedings of the Applications of Evolutionary Computing, 2001
2000
Proceedings of the Parallel Problem Solving from Nature, 2000
Proceedings of the 2000 Congress on Evolutionary Computation, 2000