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

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

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

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 the… Expand

This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL).Expand

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

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

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