Stochastic p-robust location problems

References

• Aggarwal , V. , Deo , N. and Sarkar , D. 1992 . The knapsack problem with disjoint multiple-choice constraints . Naval Research Logistics , 39 ( 2 ) : 213 – 227 . [CSA]
   Web of Science ®Google Scholar
• Armstrong , R. D. , Kung , D. S. , Sinha , P. and Zoltners , A. A. 1983 . A computational study of a multiple-choice knapsack algorithm . ACM Transactions on Mathematical Software , 9 ( 2 ) : 184 – 198 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Averbakh , I. and Berman , O. 2000 . Minmax regret median location on a network under uncertainty . INFORMS Journal on Computing , 12 ( 2 ) : 104 – 110 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Balinski , M. L. 1965 . Integer programming: methods, uses, computation . Management Science , 12 ( 3 ) : 253 – 313 . [CSA]
   Web of Science ®Google Scholar
• Barcelo , J. , Fernandez , E. and Jörnsten , K. O. 1991 . Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem . European Journal of Operational Research , 53 ( 1 ) : 38 – 45 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Brandeau , M. L. and Chiu , S. S. 1989 . An overview of representative problems in location research . Management Science , 35 ( 6 ) : 645 – 674 . [CSA]
   Web of Science ®Google Scholar
• Burkard , R. E. and Dollani , H. 2001 . Robust location problems with pos/neg weights on a tree . Networks , 38 ( 2 ) : 102 – 113 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Chen , B. and Lin , C.-S. 1998 . Minmax-regret robust 1-median location on a tree . Networks , 31 ( 2 ) : 93 – 103 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Church , R. L. and Weaver , J. R. 1986 . Theoretical links between median and coverage location problems . Annals of Operations Research , 6 : 1 – 19 . [CROSSREF] [CSA]
   Google Scholar
• Cohon , J. L. 1978 . Multiobjective programming and planning , New York : Academic Press .
   Google Scholar
• Cornuejols , G. , Fisher , M. L. and Nemhauser , G. L. 1977 . Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms . Management Science , 23 ( 8 ) : 789 – 810 . [CSA]
   Web of Science ®Google Scholar
• Cornuejols , G. , Sridharan , R. and Thizy , J. 1991 . A comparison of heuristics and relaxations for the capacitated plant location problem . European Journal of Operational Research , 50 : 280 – 297 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Current , J. , Daskin , M. S. and Schilling , D. 2002 . “ Discrete network location models ” . In Facility Location: Applications and Theory , Edited by: Drezner , Z. and Hamacher , H. W. New York, NY : Springer-Verlag . ch. 3
   Google Scholar
• Current , J. , Ratick , S. and ReVelle , C. 1997 . Dynamic facility location when the total number of facilities is uncertain: a decision analysis approach . European Journal of Operational Research , 110 ( 3 ) : 597 – 609 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Daskin , M. S. 1995 . Network and Discrete Location: Models, Algorithms, and Applications , New York : Wiley .
   Google Scholar
• Daskin , M. S. 2004 . SITATION software Available for download from users.iems.northwestern.edu/∼msdaskin/
   Google Scholar
• Daskin , M. S. , Coullard , C. R. and Shen , Z.-J. M. 2002 . An inventory-location model: formulation, solution algorithm and computational results . Annals of Operations Research , 110 : 83 – 106 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Daskin , M. S. , Hesse , S. M. and ReVelle , C. S. 1997 . α-reliable p-minimax regret: a new model for strategic facility location modeling . Location Science , 5 ( 4 ) : 227 – 246 . [CROSSREF] [CSA]
   Google Scholar
• Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , New York, NY : W. H. Freeman and Company .
   Google Scholar
• Geoffrion , A. 1974 . Lagrangean relaxation for integer programming . Mathematical Programming Study , 2 : 82 – 114 . [CSA]
   Google Scholar
• Guignard , M. and Kim , S. 1987 . Lagrangean decomposition: a model yielding strong Lagrangean bounds . Mathematical Programming , 39 : 215 – 228 . [CSA]
   Web of Science ®Google Scholar
• Gutiérrez , G. J. and Kouvelis , P. 1995 . A robustness approach to international sourcing . Annals of Operations Research , 59 : 165 – 193 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Gutiérrez , G. J. , Kouvelis , P. and Kurawarwala , A. A. 1996 . A robustness approach to uncapacitated network design problems . European Journal of Operational Research , 94 : 362 – 376 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Hakimi , S. L. 1964 . Optimum locations of switching centers and the absolute centers and medians of a graph . Operations Research , 12 ( 3 ) : 450 – 459 . [CSA]
   Web of Science ®Google Scholar
• Hakimi , S. L. 1965 . Optimum distribution of switching centers in a communication network and some related graph theoretic problems . Operations Research , 13 ( 3 ) : 462 – 475 . [CSA]
   Web of Science ®Google Scholar
• Kouvelis , P. , Kurawarwala , A. A. and Gutiérrez , G. J. 1992 . Algorithms for robust single and multiple period layout planning for manufacturing systems . European Journal of Operational Research , 63 : 287 – 303 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Kouvelis , P. and Yu , G. 1997 . Robust Discrete Optimization and its Applications , Boston : Kluwer Academic Publishers .
   Google Scholar
• Louveaux , F. V. 1993 . Stochastic location analysis . Location Science , 1 ( 2 ) : 127 – 154 . [CSA]
   Google Scholar
• Mirchandani , P. B. , Oudjit , A. and Wong , R. T. 1985 . ‘Multidimensional’ extensions and a nested dual approach for the m-median problem . European Journal of Operational Research , 21 ( 1 ) : 121 – 137 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Nakagawa , Y. , Kitao , M. , Tsuji , M. and Teraoka , Y. 2001 . Calculating the upper bound of the multiple-choice knapsack problem . Electronics and Communications in Japan Part 3 , 84 ( 7 ) : 22 – 27 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Nauss , R. 1978 . The 0-1 knapsack problem with multiple choice constraints . European Journal of Operational Research , 2 : 125 – 131 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Nemhauser , G. L. and Wolsey , L. A. 1988 . Integer and Combinatorial Optimization , New York : Wiley .
   Google Scholar
• Owen , S. H. and Daskin , M. S. 1998 . Strategic facility location: a review . European Journal of Operational Research , 111 ( 3 ) : 423 – 447 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Pisinger , D. 1995 . A minimal algorithm for the multiple-choice knapsack problem . European Journal of Operational Research , 83 ( 2 ) : 394 – 410 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Serra , D. and Marianov , V. 1998 . The p-median problem in a changing network: the case of Barcelona . Location Science , 6 : 383 – 394 . [CROSSREF] [CSA]
   Google Scholar
• Serra , D. , Ratick , S. and ReVelle , C. 1996 . The maximum capture problem with uncertainty . Environment and Planning B , 23 : 49 – 59 . [CSA]
   Google Scholar
• Shen , Z.-J. M. , Coullard , C. R. and Daskin , M. S. 2003 . A joint location-inventory model . Transportation Science , 37 ( 1 ) : 40 – 55 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Sheppard , E. S. 1974 . A conceptual framework for dynamic location-allocation analysis . Environment and Planning A , 6 : 547 – 564 . [CSA]
   Web of Science ®Google Scholar
• Sinha , P. and Zoltners , A. A. 1979 . The multiple-choice knapsack problem . Operations Research , 27 ( 3 ) : 503 – 515 . [CSA]
   Web of Science ®Google Scholar
• Snyder , L. V. 2003 . Supply chain robustness and reliability: models and algorithms , PhD thesis Evanston, IL : Northwestern University .
   Google Scholar
• Snyder , L. V. 2006 . Facility location under uncertainty: a review . IIE Transactions , 38 ( 7 ) : 537 – 554 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Snyder , L. V. 2005 . A note on the robust international sourcing algorithm of Gutiérrez and Kouvelis (submitted for publication)
   Google Scholar
• Swain , R. 1971 . A decomposition algorithm for a class of facility location problems , PhD thesis Ithaca, NY : Cornell University .
   Google Scholar
• Vairaktarakis , G. L. and Kouvelis , P. 1999 . Incorporation dynamic aspects and uncertainty in 1-median location problems . Naval Research Logistics , 46 ( 2 ) : 147 – 168 . [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Weaver , J. R. and Church , R. L. 1983 . Computational procedures for location problems on stochastic networks . Transportation Science , 17 ( 2 ) : 168 – 180 . [CSA]
   Web of Science ®Google Scholar