Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.orl.2006.01.012 | Oper. Res. Lett. |
Keywords | Field | DocType |
basic preprocessing analysis,preprocessing,location,valid inequality,discrete location,strengthened formulation,branch-and-bound,integer programming,simple plant location problem,well-known simple plant location,computational study | Mathematical optimization,Preprocessor,Calculus,Mathematics | Journal |
Volume | Issue | ISSN |
35 | 2 | Operations Research Letters |
Citations | PageRank | References |
20 | 1.23 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lázaro Cánovas | 1 | 140 | 11.27 |
| Sergio García | 2 | 114 | 9.10 |
| martine labbe | 3 | 1238 | 108.61 |
| Alfredo Marín | 4 | 453 | 32.98 |