Name
Abstract | ||
|---|---|---|
Flexible discrete location problems are a generalization of most classical discrete locations problems like p-median or p-center problems. They can be modeled by using so-called ordered median functions. These functions multiply a weight to the cost of fulfilling the demand of a customer, which depends on the position of that cost relative to the costs of fulfilling the demand of other customers. In this paper a covering type of model for the discrete ordered median problem is presented. For the solution of this model two sets of valid inequalities, which reduces the number of binary variables tremendously, and several variable fixing strategies are identified. Based on these concepts a specialized branch & cut procedure is proposed and extensive computational results are reported. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.dam.2008.03.013 | Discrete Applied Mathematics |
Keywords | Field | DocType |
valid inequality,variable fixing,discrete location,valid inequalities,cut procedure,binary variable,flexible model,specialized branch,flexible discrete location problem,discrete ordered median problem,extensive computational result,classical discrete locations problem,p-center problem,efficient solution strategy,median function,median problem | Combinatorics,Weight function,Facility location problem,Inequality,Mathematics,Binary number,Special ordered set | Journal |
Volume | Issue | ISSN |
157 | 5 | Discrete Applied Mathematics |
Citations | PageRank | References |
20 | 0.94 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alfredo Marín | 1 | 453 | 32.98 |
| Stefan Nickel | 2 | 427 | 41.70 |
| Justo Puerto | 3 | 717 | 73.21 |
| Sebastian Velten | 4 | 33 | 2.66 |