The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p
facilities, considering distances and capacities for the service to be given by each median. In …

A tabu search heuristic procedure is developed to solve the uncapacitated facility location
problem. Tabu search is used to guide the solution process when evolving from one solution …

The search for p-median vertices on a network (graph) is a classical location problem. The p
facilities (medians) must be located so as to minimize the sum of the distances from each …

In this paper, we present Forge, an optimal algorithm for gate sizing using the Elmore delay
model. The algorithm utilizes Lagrangian relaxation with a fast gradient-based pre …

A tabu search heuristic procedure is developed, implemented and computationally tested for
the capacitated facility location problem. The procedure uses different memory structures …

O problema de p-medianas consiste em decidir onde localizar p centros em uma rede
composta por vértices e arestas, de forma a minimizar a soma de todas as distâncias de …

In this article, we propose an extension of the capacitated facility location problem under
uncertainty, where uncertainty may appear in the model's key parameters such as demands …

In this paper, we address the Capacitated Facility Location Problem (CFLP) in which the
assignment of facilities to customers must ensure enough facility capacity and all the …

This paper introduces a cooperative approach of a swarm intelligence algorithm and a linear
programming solver to solve the capacitated facility location problem (CFLP). Given a set of …

Apresenta-se uma resenha sobre problemas de análise espacial que podem ser
identificados em redes, e que apresentam-se como problemas importantes do ponto de …