×

A strengthened formulation for the simple plant location problem with order. (English) Zbl 1149.90363

Summary: 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.

MSC:

90B80 Discrete location and assignment

Software:

XPRESS; OR-Library
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Beasley, E., OR-Library: distributing test problems by electronic mail, J. Oper. Res. Soc., 41, 11, 1069-1072 (1990), \( \langle\) www.brunel.ac.uk/depts/ma/research/jeb/info.html \(\rangle \)
[2] P. Belotti, M. Labbé, F. Maffioli, M. Ndiaye, A branch-and-cut method for the obnoxious \(p\); P. Belotti, M. Labbé, F. Maffioli, M. Ndiaye, A branch-and-cut method for the obnoxious \(p\) · Zbl 1145.90106
[3] Cho, D. C.; Johnson, E. L.; Padberg, M. W.; Rao, M. R., On the uncapacitated plant location problem I: valid inequalities and facets, Math. Oper. Res., 8, 4, 579-589 (1983) · Zbl 0536.90029
[4] Cho, D. C.; Padberg, M. W.; Rao, M. R., On the uncapacitated plant location problem II: facets and lifting theorems, Math. Oper. Res., 8, 4, 590-612 (1983) · Zbl 0536.90030
[5] Church, R. L., COBRA: a new formulation of the classic \(p\)-median location problem, Ann. Oper. Res., 122, 103-120 (2003) · Zbl 1039.90023
[6] Cornuéjols, G.; Fisher, M. L.; Nemhauser, G. L., On the uncapacitated location problem, Ann. Discrete Math., 1, 163-177 (1977)
[7] Dobson, G.; Karmakar, U. S., Competitive location on a network, Oper. Res., 35, 565-574 (1987) · Zbl 0636.90025
[8] Gerrard, R. A.; Church, R. L., Closest assignment constraints and location models: properties and structure, Location Sci., 4, 4, 251-270 (1996) · Zbl 0930.90054
[9] Goldengorin, B.; Ghosh, D.; Siersksma, G., Branch and peg algorithms for the simple plant location problem, Comput. Oper. Res., 31, 2, 241-255 (2004) · Zbl 1087.90039
[10] Hanjoul, P.; Peeters, D., A facility location problem with clients’ preference orderings, Regional Sci. Urban Econom., 17, 451-473 (1987)
[11] P. Hansen, Y. Kochetov, N. Mladenovic, Lower bounds for the uncapacitated facility location problem with user preferences, Les Cahiers du GERAD G-2004-24, 2004.; P. Hansen, Y. Kochetov, N. Mladenovic, Lower bounds for the uncapacitated facility location problem with user preferences, Les Cahiers du GERAD G-2004-24, 2004.
[12] N. Mladenovic, J. Brimberg, P. Hansen, A note on duality gap in the simple plant location problem, European J. Oper. Res., to appear.; N. Mladenovic, J. Brimberg, P. Hansen, A note on duality gap in the simple plant location problem, European J. Oper. Res., to appear. · Zbl 1116.90072
[13] Rojeski, P.; Revelle, C. S., Central facilities location under an investment constraint, Geographical Anal., 2, 343-360 (1970)
[14] Wagner, J. L.; Falkson, L. M., The optimal nodal location of public facilities with price-sensitive demand, Geographical Anal., 7, 69-83 (1975)
[15] Xpress-MP, Dash-optimization. \( \langle;\) http://www.dashoptimization.com/\( \rangle;\); Xpress-MP, Dash-optimization. \( \langle;\) http://www.dashoptimization.com/\( \rangle;\)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.