Branch and peg algorithms for the simple plant location problem

Computers and Operations Research

Volumn 30, Issue 7, 2003, Pages 967-981

  Goldengorin, Boris ^a   Ghosh, Diptesh ^b   Sierksma, Gerard ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b INDIAN INSTITUTE OF MANAGEMENT   (India)

Author keywords

Beresnev function; Branch and bound; Pegging; Preprocessing; Pseudo Boolean representation; Simple plant location problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COSTS; LOCATION; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION;

OPERATIONS RESEARCH;

INDUSTRIAL LOCATION;

EID: 0037410675     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00049-7     Document Type: Article

References (17)

1. Christofides N. Graph theory: an algorithmic approach. London: Academic Press Inc. Ltd., 1975.
2. Beresnev VL, Gimadi EKh, Dementyev VT. Extremal standardization problems. Novosibirsk: Nauka, 1978 [in Russian].
3. Goldengorin B. Requirements of standards: optimization models and algorithms. ROR, Hoogezand, The Netherlands, 1995.
4. Jones PC, Lowe TJ, Muller G, Xu N, Ye Y, Zydiak JL. Specially structured uncapacitated facility location problems. Operations Research 1995;43:661-9.
5. Pentico DW. The assortment problem with nonlinear cost functions. Operations Research 1976;24:1129-42.
6. Pentico DW. The discrete two-dimensional assortment problem. Operations Research 1988;36:324-32.
7. Tripathy A, Süral H, Gerchak Y. Multidimensional assortment problem with an application. Networks 1999;33:239-45.
8. Revelle CS, Laporte G. The plant location problem: new models and research prospects. Operations Research 1996;44 864-74.
9. Cornuejols G, Nemhauser GL, Wolsey LA. The uncapacitated facility location problem. In: Francis RL, Mirchandani PB, editors. Discrete location theory. New York: Wiley-Interscience, 1990. p. 119-71.
10. Beasley JE. Lagrangian heuristics for location problems. European Journal of Operational Research 1993;65:383-99.
11. Hammer PL. Plant location-a pseudo-Boolean approach. Israel Journal of Technology 1968;6:330-2.
12. Beresnev VL. On a problem of mathematical standardization theory. Upravliajemyje Sistemy 1973;11:43-54 ([in Russian]).
13. Goldengorin B, Ghosh D, Sierksma G. Equivalent instances of the simple plant location problem. SOM Research Report-OOA54, University of Groningen, The Netherlands, 2000 (available from http://www.ub.rug.nl/eldoc/som/a/OOA54/).
14. Goldengorin B, Sierksma G, Tijssen GA, Tso M. The data-correcting algorithm for minimization of supermodular functions. Management Science 1999;45:1539-51.
15. Beasley JE. OR-Library, http://mscmga.ms.ic.ac.uk/info.html.
16. Goldengorin B. On the exact solution of standardization problems by correcting algorithms. Soviet Physics Doklady 1987;32:432-4.
17. Goldengorin B, Tijssen GA, Ghosh D, Sierksma G. Solving the simple plant location problem using a data correcting approach. SOM Research Report-O1A53, University of Groningen, The Netherlands, 2001 (available from http://www.ub.mg.nl/eldoc/som/a/O1A53/).