References
- AgarMCSalhiSLagrangian heuristics applied to a variety of large capacitated plant location problemsJ Opl Res Soc1998491072108410.1057/palgrave.jors.2600621
- BeasleyJELagrangian relaxationModern Heuristic Techniques for Combinatorial Problems1993243303
- BermanODreznerZWesolowskyGOThe expropriation location problemJ Opl Res Soc20035476977610.1057/palgrave.jors.2601548
- BermanOKrassDThe generalized maximal covering location problemComput Opns Res20022656358110.1016/S0305-0548(01)00079-X
- Berman O and Wang Q (forthcoming). Locating semi-obnoxious facilities with expropriation. Comput Opns Res, Special Issue on Location, in press.
- BrimbergJJuelHA bicriteria model for locating a semi-desirable facility in the planeEur J Opl Res199810614415110.1016/S0377-2217(97)00251-8
- CornuejolsGFisherMLNemhauserGLLocation of bank accounts to optimize float: an analytical study of exact and approximate algorithmsMngt Sci19772378981010.1287/mnsc.23.8.789
- ChurchRLGarfinkelRSLocating an obnoxious facility on a networkTransport Sci19781210711810.1287/trsc.12.2.107
- ChurchRLRevelleCThe maximal covering location problemPapers Regional Sci Assoc19743210111810.1007/BF01942293
- ErkutENeumanSAnalytical models for locating undesirable facilitiesEur J Opl Res19894027529110.1016/0377-2217(89)90420-7
- MelachrinoudisEBicriteria location of a semi-obnoxious facilityComput Indust Eng19993758159310.1016/S0360-8352(00)00022-X
- NarulaSCOgbuVISamuelssonHMAn algorithm for the p-median problemOpns Res19772570971210.1287/opre.25.4.709