Branch and peg algorithms for the simple plant location problem

Computers and Operations Research

Volumn 31, Issue 2, 2004, Pages 241-255

  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

ACCIDENT PREVENTION; ALGORITHMS; COMPUTATIONAL METHODS; COSTS; OPTIMIZATION;

EXECUTION TIMES;

OPERATIONS RESEARCH;

ALGORITHM;

EID: 0347093223     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00190-9     Document Type: Article

References (18)

1. 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.
2. Fourer R, Goux J-P. Optimization as an internet resource. Interfaces 2001;31:130-50.
3. Christofides N. Graph theory: an algorithmic approach. London: Academic Press, 1975.
4. Beresnev VL, Gimadi EKh, Dementyev VT. Extremal standardization problems. Nauka: Novosibirsk, 1978.
5. Goldengorin B. Requirements of standards: optimization models and algorithms. Hoogezand, The Netherlands: ROR, 1995.
6. Jones PC, Lowe TJ, Muller G, Xu N, Ye Y, Zydiak JL. Specially structured uncapacitated facility location problems. Operations Research 1995;43:661-9.
7. Pentico DW. The assortment problem with nonlinear cost functions. Operations Research 1976;24:1129-42.
8. Pentico DW. The discrete two-dimensional assortment problem. Operations Research 1988;36:324-32.
9. Tripathy A, Süral, Gerchak Y. Multidimensional assortment problem with an application. Networks 1999;33: 239-45.
10. Revelle CS, Laporte G. The plant location problem: new models and research prospects. Operations Research 1996;44:864-74.
11. Beasley JE. Lagrangian heuristics for location problems. European Journal of Operational Research 1993;65:383-99.
12. Hammer PL. Plant location-a pseudo-Boolean approach. Israel Journal of Technology 1968;6:330-2.
13. Beresnev VL. On a problem of mathematical standardization theory. Upravliajemyje Sistemy 1973;11:43-54 (in Russian).
14. Goldengorin B, Ghosh D, Sierksma G. Equivalent instances of the simple plant location problem. SOM Research Report-00A54, University of Groningen, The Netherlands, 2000 (available from http: // http://www.ub.rug.nl/eldoc/som/a/00A54).
15. Goldengorin B, Sierksma G, Tijssen GA, Tso M. The data-correcting algorithm for minimization of supermodular functions. Management Science 1999;45:1539-51.
16. Beasley JE. OR-Library, http://mscmga.ms.ic.ac.uk/info.html
17. Goldengorin B. On the exact solution of standardization problems by correcting algorithms. Soviet Physics-Doklady 1987;32:432-4.
18. Goldengorin B, Tijssen GA, Ghosh D, Sierksma G. Solving the simple plant location problem using a data correcting approach. SOM Research Report-01A53, University of Groningen, The Netherlands, 2001 (available from http://www.ub.rug.n1/eldoc/som/a/01A53/).