• Publications
  • Influence
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem
TLDR
We can solve all benchmark instances from the literature to optimality, including some of them for which the optimum was not known. Expand
  • 201
  • 16
  • PDF
Solving the simple plant location problem by genetic algorithm
TLDR
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. Expand
  • 164
  • 12
  • PDF
Redesigning Benders Decomposition for Large-Scale Facility Location
TLDR
This article studies linear and convex quadratic variant of one of the most famous and most studied problems in the Operations Research literature: the Uncapacitated Facility Location (UFL) problem. Expand
  • 85
  • 10
  • PDF
Solving the Prize-Collecting Steiner Tree Problem to Optimality
TLDR
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus the total profit of all vertices not contained inthe subtree. Expand
  • 45
  • 9
  • PDF
The regenerator location problem
TLDR
In this article, we introduce the regenerator location problem (RLP), which deals with a constraint on the geographical extent of transmission in optical networks. Expand
  • 83
  • 8
  • PDF
The recoverable robust facility location problem
This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against theExpand
  • 27
  • 8
  • PDF
MIP models for connected facility location: A theoretical and computational study☆
TLDR
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). Expand
  • 72
  • 7
  • PDF
A Genetic Algorithm for the Index Selection Problem
TLDR
We propose a genetic algorithm for the Index Selection Problem based on binary encoding, efficient data structures (for the evaluation of the objective function), on the uniform crossover, and simple mutation. Expand
  • 65
  • 7
A Hybrid VNS for Connected Facility Location
  • I. Ljubic
  • Mathematics, Computer Science
  • Hybrid Metaheuristics
  • 8 October 2007
TLDR
We show how to combine a variable neighborhood search method with a reactive tabu-search, in order to find sub-optimal solutions for large scale instances. Expand
  • 35
  • 6
Thinning out Steiner trees: a node-based model for uniform edge costs
TLDR
In this paper we introduce a new Mixed-Integer Linear Programming (MIP) approach for solving hard instances of the Steiner tree problem (close) to optimality. Expand
  • 64
  • 5
  • PDF