On the capacitated concentrator location problem: a reformulation by discretization

Authors:
Luís Gouveia;Francisco Saldanha-da-Gama
Affiliations:
Department of Statistics and Operational Research/Operational Research Centre, Faculty of Science, University of Lisbon, BLOCO, Piso, Lisboa, Portugal;Department of Statistics and Operational Research/Operational Research Centre, Faculty of Science, University of Lisbon, BLOCO, Piso, Lisboa, Portugal
Venue:
Computers and Operations Research
Year:
2006

Citing 5
Cited 2

A cross decomposition procedure for the facility location problem with a choice of facility type

Computers and Industrial Engineering
Efficient algorithms for the capacitated concentrator location problem

Computers and Operations Research
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes

Operations Research
A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science

Solving the variable size bin packing problem with discretized formulations

Computers and Operations Research
Lower and upper bounds for a two-level hierarchical location problem in computer networks

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we present and discuss a discretized model for the two versions of the capacitated concentrator location problem: a simple version (SCCLP) and a version with modular capacities (MCCLP). We show that the linear programming relaxation of the discretized model is at least as good as the linear programming relaxation of conventional models for the two variations of the problem under study. A technique for deriving valid inequalities from the equations of the discretized model is also given. We will show that this technique provides inequalities that significantly enhance the linear programming bound of the discretized model. Our computational results show the advantage of the new models for obtaining the optimal integer solution for the two versions of the problem.