A strengthened formulation for the simple plant location problem with order

Authors:
LáZaro CáNovas;Sergio GarcíA;Martine Labbé;Alfredo MaríN
Affiliations:
Departamento de Estadística e Investigación Operativa, Universidad de Murcia, Spain;Departamento de Estadística e Investigación Operativa, Universidad de Murcia, Spain;Departément d'Informatique, Université Libre de Bruxelles, Belgium;Departamento de Estadística e Investigación Operativa, Universidad de Murcia, Spain
Venue:
Operations Research Letters
Year:
2007

Citing 2
Cited 3

Competitive location on a network

Operations Research
Branch and peg algorithms for the simple plant location problem

Computers and Operations Research

A comparison of formulations and solution methods for the minimum-envy location problem

Computers and Operations Research
A flexible model and efficient solution strategies for discrete location problems

Discrete Applied Mathematics
Solving Large p-Median Problems with a Radius Formulation

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The simple plant location problem with order, a generalization of the well-known simple plant location problem where preferences for the customers are considered, is studied here. Some valid inequalities are introduced as well as a basic preprocessing analysis. A computational study shows the efficiency of this approach.