Name
Abstract | ||
|---|---|---|
The objective of this paper is to identify the most promising sets of closest assignment constraints in the literature of Discrete Location Theory, helping the authors in the field to model their problems when clients must be assigned to the closest plant inside an Integer Programming formulation. In particular, constraints leading to weak Linear Programming relaxations should be avoided if no other good property supports their use. We also propose a new set of constraints with good theoretical properties. (C) 2011 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ejor.2011.12.002 | European Journal of Operational Research |
Keywords | Field | DocType |
Discrete location,Integer programming,Valid inequalities,Closest assignment | Mathematical optimization,Location theory,Integer programming,Linear programming,Mathematics | Journal |
Volume | Issue | ISSN |
219 | 1 | 0377-2217 |
Citations | PageRank | References |
19 | 0.85 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Inmaculada Espejo | 1 | 41 | 3.17 |
| Alfredo Marín | 2 | 453 | 32.98 |
| Antonio M. Rodríguez-Chía | 3 | 143 | 15.47 |