Ljubic Ivana

Ivana Ljubic

Information about the author Ivana Ljubic will soon be added to the site.
Found 8 papers in total
Redesigning Benders Decomposition for Large-Scale Facility Location
Redesigning Benders Decomposition for Large-Scale Facility Location
2017
The uncapacitated facility location (UFL) problem is one of the most famous and most...
A node-based ILP formulation for the node-weighted dominating Steiner problem
A node-based ILP formulation for the node-weighted dominating Steiner problem
2017
In this article, we consider the Node‐Weighted Dominating Steiner Problem....
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
2013
We improve the well‐known result presented in Bertsimas and Sim (2003)...
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
2013
We consider a network design problem that arises in the cost‐optimal design of...
Exact approaches for solving robust prize‐collecting Steiner tree problems
Exact approaches for solving robust prize‐collecting Steiner tree problems
2013
In the Prize‐Collecting Steiner Tree Problem (PCStT) we are given a set of...
Enhanced formulations and branch‐and‐cut for the two level network design problem with transition facilities
Enhanced formulations and branch‐and‐cut for the two level network design problem with transition facilities
2013
We develop a branch‐and‐cut algorithm for solving the TLNDF. The...
Solving the simple plant location problem by genetic algorithm
Solving the simple plant location problem by genetic algorithm
2001
The simple plant location problem (SPLP) is considered and a genetic algorithm is...
A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs
A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs
2003
This paper considers the problem of augmenting a given graph by a cheapest possible...
Papers per page: