Lista de obras - Ivana Ljubic - Dominio Público Uruguay

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

A GRASP Algorithm for the Connected Facility Location Problem

artículo científico publicado en 2008

A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem

artículo científico publicado en 2011

A MIP-based approach to solve the prize-collecting local access network design problem

artículo científico publicado en 2014

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

artículo científico publicado en 2003

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs

artículo científico publicado en 2017

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes

artículo científico publicado en 2011

A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs

A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation

artículo científico publicado en 2009

A cutting plane algorithm for the Capacitated Connected Facility Location Problem

artículo científico publicado en 2013

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems

artículo científico publicado en 2013

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

An algorithmic framework for the exact solution of tree-star problems

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

Benders decomposition for very large scale partial set covering and maximal covering location problems

artículo científico publicado en 2019

Decomposition methods for the two-stage stochastic Steiner tree problem

scientific article published on 20 November 2017

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities

artículo científico publicado en 2013

Evolutionary local search for the edge-biconnectivity augmentation problem

artículo científico publicado en 2002

Exact Approaches for Network Design Problems with Relays

artículo científico publicado en 2019

Exact approaches for solving robust prize-collecting Steiner tree problems

artículo científico publicado en 2013

Exact approaches to the single-source network loading problem

artículo científico publicado en 2011

Hop constrained Steiner trees with multiple root nodes

article by Luis Gouveia et al published July 2014 in European Journal of Operational Research

ILP and CP Formulations for the Lazy Bureaucrat Problem

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design

Intersection Cuts for Bilevel Optimization

artículo científico publicado en 2016

Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

artículo científico publicado en 2013

MIP Modeling of Incremental Connected Facility Location

artículo científico publicado en 2011

MIP models for connected facility location: A theoretical and computational study

artículo científico publicado en 2011

Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs

artículo científico publicado en 2010

On the Asymmetric Connected Facility Location Polytope

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes

article by Luis Gouveia et al published 2012 in Lecture Notes in Computer Science

On the Two-Architecture Connected Facility Location Problem

scholarly article by Markus Leitner et al published June 2013 in Electronic Notes in Discrete Mathematics

On the use of intersection cuts for bilevel optimization

artículo científico publicado en 2017

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

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities

QTL mapping using a memetic algorithm with modifications of BIC as fitness function

artículo científico publicado en 2012

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method

scholarly article by Markus Leitner et al published June 2013 in Electronic Notes in Discrete Mathematics

Stochastic Survivable Network Design Problems

Stochastic survivable network design problems: Theory and practice

Strong Formulations for 2-Node-Connected Steiner Network Problems

The Generalized Regenerator Location Problem

artículo científico publicado en 2015

The Maximum Weight Connected Subgraph Problem

The Recoverable Robust Two-Level Network Design Problem

artículo científico publicado en 2015

The Rooted Maximum Node-Weight Connected Subgraph Problem

The Two Level Network Design Problem with Secondary Hop Constraints

artículo científico publicado en 2011

The connected facility location polytope

scholarly article by Markus Leitner et al published January 2018 in Discrete Applied Mathematics

The maximum clique interdiction problem

artículo científico publicado en 2019

The recoverable robust facility location problem

artículo científico publicado en 2015

The two-level diameter constrained spanning tree problem

article by Luis Gouveia et al published 12 January 2014 in Mathematical Programming

Thinning out Steiner trees: a node-based model for uniform edge costs

article

Tighter MIP models for Barge Container Ship Routing

Variable Neighborhood Search for Solving the Balanced Location Problem

scholarly article by Jozef Kratica et al published December 2012 in Electronic Notes in Discrete Mathematics

Lista de obras de Ivana Ljubic

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

A GRASP Algorithm for the Connected Facility Location Problem

A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem

A MIP-based approach to solve the prize-collecting local access network design problem

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes

A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs

A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation

A cutting plane algorithm for the Capacitated Connected Facility Location Problem

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem

An algorithmic framework for the exact solution of tree-star problems

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

Benders decomposition for very large scale partial set covering and maximal covering location problems

Decomposition methods for the two-stage stochastic Steiner tree problem

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities

Evolutionary local search for the edge-biconnectivity augmentation problem

Exact Approaches for Network Design Problems with Relays

Exact approaches for solving robust prize-collecting Steiner tree problems

Exact approaches to the single-source network loading problem

Hop constrained Steiner trees with multiple root nodes

ILP and CP Formulations for the Lazy Bureaucrat Problem

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design

Intersection Cuts for Bilevel Optimization

Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

MIP Modeling of Incremental Connected Facility Location

MIP models for connected facility location: A theoretical and computational study

Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs

On the Asymmetric Connected Facility Location Polytope

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes

On the Two-Architecture Connected Facility Location Problem

On the use of intersection cuts for bilevel optimization

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

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities

QTL mapping using a memetic algorithm with modifications of BIC as fitness function

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method

Stochastic Survivable Network Design Problems

Stochastic survivable network design problems: Theory and practice

Strong Formulations for 2-Node-Connected Steiner Network Problems

The Generalized Regenerator Location Problem

The Maximum Weight Connected Subgraph Problem

The Recoverable Robust Two-Level Network Design Problem

The Rooted Maximum Node-Weight Connected Subgraph Problem

The Two Level Network Design Problem with Secondary Hop Constraints

The connected facility location polytope

The maximum clique interdiction problem

The recoverable robust facility location problem

The two-level diameter constrained spanning tree problem

Thinning out Steiner trees: a node-based model for uniform edge costs

Tighter MIP models for Barge Container Ship Routing

Variable Neighborhood Search for Solving the Balanced Location Problem