메뉴 건너뛰기




Volumn 6, Issue 1-4, 1998, Pages 109-120

A minisum model with forbidden regions for locating a semi-desirable facility in the plane

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0038507943     PISSN: 09668349     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0966-8349(98)00050-3     Document Type: Article
Times cited : (10)

References (13)
  • 1
    • 0012651644 scopus 로고    scopus 로고
    • A bicriteria model for locating a semi-desirable facility in the plane
    • Brimberg, J., Juel, H., 1998. A bicriteria model for locating a semi-desirable facility in the plane. European Journal of Operational Research 106, 144-151.
    • (1998) European Journal of Operational Research , vol.106 , pp. 144-151
    • Brimberg, J.1    Juel, H.2
  • 2
    • 21144460712 scopus 로고
    • Local convergence in a generalized Fermat-Weber problem
    • Brimberg, J., Love, R.F., 1992. Local convergence in a generalized Fermat-Weber problem. Annals of Operations Research 40, 33-66.
    • (1992) Annals of Operations Research , vol.40 , pp. 33-66
    • Brimberg, J.1    Love, R.F.2
  • 4
    • 0000051426 scopus 로고
    • The rectilinear distance minisum problem with minimum distance constraints
    • to appear
    • Brimberg, J., Wesolowsky, G.O., 1995. The rectilinear distance minisum problem with minimum distance constraints. Location Science, to appear.
    • (1995) Location Science
    • Brimberg, J.1    Wesolowsky, G.O.2
  • 7
    • 0026867628 scopus 로고
    • A branch and bound algorithm for the location of facilities causing atmospheric pollution
    • Karkazis, J., Papadimitriou, C., 1992. A branch and bound algorithm for the location of facilities causing atmospheric pollution. European Journal of Operational Research 58, 363-373.
    • (1992) European Journal of Operational Research , vol.58 , pp. 363-373
    • Karkazis, J.1    Papadimitriou, C.2
  • 8
    • 0016027631 scopus 로고
    • Local convergence in Fermat's problem
    • Katz, I.N., 1974. Local convergence in Fermat's problem. Mathematical Programming 6, 89-104.
    • (1974) Mathematical Programming , vol.6 , pp. 89-104
    • Katz, I.N.1
  • 9
    • 34250438259 scopus 로고
    • A note on Fermat's problem
    • Kuhn, H.W., 1973. A note on Fermat's problem. Mathematical Programming 4, 98-107.
    • (1973) Mathematical Programming , vol.4 , pp. 98-107
    • Kuhn, H.W.1
  • 11
    • 0021385740 scopus 로고
    • An analysis of network location problems with distance constraints
    • Moon, I.D., Chaudhry, S.S., 1984. An analysis of network location problems with distance constraints. Management Science 30, 290-307.
    • (1984) Management Science , vol.30 , pp. 290-307
    • Moon, I.D.1    Chaudhry, S.S.2
  • 12
    • 84925920612 scopus 로고
    • A new norm for measuring distance which yields linear location problems
    • Ward, J.E., Wendell, R.E., 1980. A new norm for measuring distance which yields linear location problems. Operations Research 28, 836-844.
    • (1980) Operations Research , vol.28 , pp. 836-844
    • Ward, J.E.1    Wendell, R.E.2
  • 13
    • 0022130543 scopus 로고
    • Using block norms for location modeling
    • Ward, J.E., Wendell, R.E., 1985. Using block norms for location modeling. Operations Research 33, 1074-1090.
    • (1985) Operations Research , vol.33 , pp. 1074-1090
    • Ward, J.E.1    Wendell, R.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.