The Uncapacitated Facility Location Problem With Primary and Secondary Facility Requirements

References

• Bazaara , M. S. and Goode , J. J. “ A Survey of Various Tactics for Generating Lagrangian Multipliers in the Context of Lagrangian Duality ,” European Journal of Operational Research , 3 , 322 – 338 ( 1979 ).
   Web of Science ®Google Scholar
• Bilde , O. , and Krarup , J. , “ Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem ,” Ann. Discrete Math. , I , 769 – 88 ( 1977 ).
   Google Scholar
• Cornuejols , G. , Fisher , M. L. and Nemhauscr , G. L. , “ Location of Bank Accounts to Optimize Float ,” Management Science , 23 , 8 , 789 – 810 ( 1977 ).
   Web of Science ®Google Scholar
• Efroymson , M. A. , Ray , T. L. , “ A Branch-bound Algorithm for Plant Location ,” Operations Research , 14 , 361 – 368 ( 1966 ).
   Web of Science ®Google Scholar
• Erlenkotter , D. , “ Facility Location with Price Sensitive Demands Private, Public and Quasi-public ,” Management Science , 24 , 378 – 386 ( 1977 ).
   Web of Science ®Google Scholar
• Erleniorter , D. , “ A Dual Based Procedure for Uncapacitated Facility Location ,” Operations Research , 26 , 1 , 992 – 1009 ( 1978 ).
   Google Scholar
• Fisher , M. L. , “ Lagrangian Relaxation Method for Solving tflleger Programming Problems ,” Management Science , 27 , 1 , 1 – 18 ( 1963 ).
   Web of Science ®Google Scholar
• Gnvish , B. and Pirkul , H. , “ Computer and Database Location in Dis tributed Computer Systems ,” IEEE Transactions on Computers , c-35 , 7 , 583 – 590 ( 1986 ).
   Web of Science ®Google Scholar
• Gnvish , B. , and Pirlcul , H. , “ Efficient Algorithms for Solving Multi-constraint Zero-one Knapsack Problems to OptimaJity ,” Malherruu-ical Programming , 31 , 78 – 105 ( 1985 ).
   Web of Science ®Google Scholar
• Geoffrion , A. M. ,“ Lagrangian Relaxation and its Uses in Integer Programming ,” Mathematical Programming Study , 2 , 82 – 114 ( 1974 ).
   Google Scholar
• Geoffrion , A. M. , and McBride , R. , “ Lagrangian Relaxation Applied to Capacitated Fncility Location Problems ,” AIIE Transactions , 10 , 40 – 47 ( 1978 ).
   Web of Science ®Google Scholar
• Held , M. and Karp , R. M. , “ The Travelling Salesman Problem and Minimum Spanning Trees ,” Operations Research , 18 , 1138 – 1162 ( 1970 ).
   Web of Science ®Google Scholar
• Held , M. , Wolfe , P. and Crowder , H. P. , “ Validation of Subgra-dient Optimization ,” Mathematical Programming , 5 , 62 – 88 ( 1974 ).
   Google Scholar
• Krarup , J. and Pruzan , P. M. , “ The Simple Plant Location Problem Survey and Synthesis ,” European Journal of Operational Research , 12 , 36 – 81 ( 1983 ).
   Web of Science ®Google Scholar
• Mulvey , J. M. and Crowder , H. P. , “ Cluster Analysis An Application of Lagrangian Relaxation ,” Management Science , 25 , 329 – 340 ( 1979 ).
   Web of Science ®Google Scholar
• Narula , S. C. , Ogbu , U. I. and Samuelsson , H. M. , “ An Algorithm for the P-Median Problem ,” Operations Research , 25 , 709 – 713 ( 1977 ).
   Web of Science ®Google Scholar
• Pirkul , H. , “ An Integer Programming Model for the Allocation of Databases in a Distributed Computer System .” European Journal of Operational Research , 26 , 3 ( 1986 ).
   Web of Science ®Google Scholar
• Pirkul , H. , “ The Uncapacitated Facility Location Problem with Pri-mnry and Secondary Fncility Requirements ,” Working Paper, College of Business , Ohio State University ( 1987 ) .
   Google Scholar
• Pirkul , H. , and Aras , O. A. , “ Capacitated Multiple Item Ordering Problem with Quantity Discounts ,” IIE Transactions , 17 , 3 , 207 – 211 ( 1985 ).
   Web of Science ®Google Scholar
• Pirkul , H. , and Narasimhan , S. , “ Efficient Algorithm forthe Multi-constraint General Knapsnck Problem ,” IIE Transactions , 18 , 2 , 195 – 203 ( 1986 ).
   Web of Science ®Google Scholar
• Pirkul , H. and Schilling , D. A. , “ The Siting of Emergency Service Facilities with Workload Capacities and Backup Service ,” Management Science , 34 , 7 , 896 – 908 ( 1988 ).
   Web of Science ®Google Scholar
• Pirkul , H. , Narasimhan , S. and De , P. , “ Locating Concentrators for Primary and Secondary Coverage in a Computer Communications Network ,” IEEE Transactions on Communications ,, 4 , 450 – 458 ( 1988 ).
   Web of Science ®Google Scholar
• Schrage , L. , “ Implicit Representation of Variable Upper Bounds in Linear Programming ,” Mathematical Programming Study , 4 , 118 – 132 ( 1975 ).
   Google Scholar
• Users Guide to Sciconic/VM (Version 1,30), Scicon Computer Services, Ltd ,, Brick Close, Kiln Farm, Milton KeynesMKI 13EJ U.K . ( 1983 ) .
   Google Scholar
• Weaver , J. R. , and Church , R. L. , “ A Medan Location Model with Nonclosest Facility Service ,” Transportation Science , 20 , 58 – 74 ( 1985 ).
   Web of Science ®Google Scholar
• Zadeh , L. , “ Optimality and Non-Scalar-Valued Performance Criteria ,” IEEE Transactions Automatic Control , 8 . 59 – 69 ( 1963 ).
   Web of Science ®Google Scholar