Ivana Ljubic

According to our database1, Ivana Ljubic authored at least 79 papers between 2000 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.
Eur. J. Oper. Res., 2021

2020
Location of Charging Stations in Electric Car Sharing Systems.
Transp. Sci., 2020

On integer and bilevel formulations for the <i>k</i>-vertex cut problem.
Math. Program. Comput., 2020

A polyhedral study of the diameter constrained minimum spanning tree problem.
Discret. Appl. Math., 2020

Preface: decomposition methods for hard optimization problems.
Ann. Oper. Res., 2020

Virtual Network Functions Placement and Routing Problem: Path formulation.
Proceedings of the 2020 IFIP Networking Conference, 2020

2019
Exact Approaches for Network Design Problems with Relays.
INFORMS J. Comput., 2019

Interdiction Games and Monotonicity, with Application to Knapsack Problems.
INFORMS J. Comput., 2019

A new branch-and-bound algorithm for the maximum edge-weighted clique problem.
Eur. J. Oper. Res., 2019

The maximum clique interdiction problem.
Eur. J. Oper. Res., 2019

Benders decomposition for very large scale partial set covering and maximal covering location problems.
Eur. J. Oper. Res., 2019

The incremental connected facility location problem.
Comput. Oper. Res., 2019

2018
On the use of intersection cuts for bilevel optimization.
Math. Program., 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

The connected facility location polytope.
Discret. Appl. Math., 2018

Decomposition methods for the two-stage stochastic Steiner tree problem.
Comput. Optim. Appl., 2018

2017
A node-based ILP formulation for the node-weighted dominating Steiner problem.
Networks, 2017

Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput., 2017

Redesigning Benders Decomposition for Large-Scale Facility Location.
Manag. Sci., 2017

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs.
Oper. Res., 2017

Stochastic survivable network design problems: Theory and practice.
Eur. J. Oper. Res., 2017

An algorithmic framework for the exact solution of tree-star problems.
Eur. J. Oper. Res., 2017

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.
Eur. J. Oper. Res., 2017

Feature cluster: Recent advances in exact methods for multi-objective optimisation.
Eur. J. Oper. Res., 2017

Solving minimum-cost shared arborescence problems.
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

Intersection Cuts for Bilevel Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015
The two-level diameter constrained spanning tree problem.
Math. Program., 2015

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.
INFORMS J. Comput., 2015

The Generalized Regenerator Location Problem.
INFORMS J. Comput., 2015

The Recoverable Robust Two-Level Network Design Problem.
INFORMS J. Comput., 2015

ILP and CP Formulations for the Lazy Bureaucrat Problem.
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

Hop constrained Steiner trees with multiple root nodes.
Eur. J. Oper. Res., 2014

On the Asymmetric Connected Facility Location Polytope.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs.
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

2013
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem.
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

Exact approaches for solving robust prize-collecting Steiner tree problems.
Eur. J. Oper. Res., 2013

Stochastic Survivable Network Design Problems.
Electron. Notes Discret. Math., 2013

On the Two-Architecture Connected Facility Location Problem.
Electron. Notes Discret. Math., 2013

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.
Electron. Notes Discret. Math., 2013

Lagrangian decompositions for the two-level FTTx network design problem.
EURO J. Comput. Optim., 2013

A cutting plane algorithm for the Capacitated Connected Facility Location Problem.
Comput. Optim. Appl., 2013

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems.
4OR, 2013

The Rooted Maximum Node-Weight Connected Subgraph Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Exact approaches to the single-source network loading problem.
Networks, 2012

Variable Neighborhood Search for Solving the Balanced Location Problem.
Electron. Notes Discret. Math., 2012

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
MIP models for connected facility location: A theoretical and computational study.
Comput. Oper. Res., 2011

A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

The Two Level Network Design Problem with Secondary Hop Constraints.
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

MIP Modeling of Incremental Connected Facility Location.
Proceedings of the Network Optimization - 5th International Conference, 2011

Exact solutions for the robust prize-collecting steiner tree problem.
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

2010
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation.
Networks, 2010

The regenerator location problem.
Networks, 2010

Orientation-based models for {0, 1, 2}-survivable network design: theory and practice.
Math. Program., 2010

Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs.
Electron. Notes Discret. Math., 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Obtaining optimal <i>k</i>-cardinality trees fast.
ACM J. Exp. Algorithmics, 2009

2008
A GRASP Algorithm for the Connected Facility Location Problem.
Proceedings of the 2008 International Symposium on Applications and the Internet, 2008

Strong Formulations for 2-Node-Connected Steiner Network Problems.
Proceedings of the Combinatorial Optimization and Applications, 2008

Obtaining Optimal k-Cardinality Trees Fast.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007
A Hybrid VNS for Connected Facility Location.
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
Solving the Prize-Collecting Steiner Tree Problem to Optimality.
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
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs.
J. Heuristics, 2003

A Genetic Algorithm for the Index Selection Problem.
Proceedings of the Applications of Evolutionary Computing, 2003

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.
Proceedings of the Algorithms, 2003

2002
Evolutionary local search for the edge-biconnectivity augmentation problem.
Inf. Process. Lett., 2002

A Memetic Algorithm for Vertex-Biconnectivity Augmentation.
Proceedings of the Applications of Evolutionary Computing, 2002

2001
Solving the simple plant location problem by genetic algorithm.
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
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem.
Proceedings of the Parallel Problem Solving from Nature, 2000


  Loading...