메뉴 건너뛰기




Volumn 51, Issue 3, 2000, Pages 371-375

A mixed integer programming formulation for the 1-maximin problem

Author keywords

1 maximin; Facility location; MIP; Rectilinear; Tchebycheff

Indexed keywords

FUNCTIONS; INTEGER PROGRAMMING; PROBLEM SOLVING;

EID: 0033880238     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600878     Document Type: Article
Times cited : (8)

References (14)
  • 1
    • 0024682446 scopus 로고
    • Analytical models for locating undesirable facilities
    • Erkut E and Neuman S (1989). Analytical models for locating undesirable facilities. Eur J Opl Res 40: 275-291.
    • (1989) Eur J Opl Res , vol.40 , pp. 275-291
    • Erkut, E.1    Neuman, S.2
  • 2
    • 0012932582 scopus 로고    scopus 로고
    • Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
    • forthcoming
    • Sayin S (2000). Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math Program, forthcoming.
    • (2000) Math Program
    • Sayin, S.1
  • 3
    • 0000799310 scopus 로고
    • A maxmin location problem
    • Dasarathy B and White LJ (1980). A maxmin location problem. Op Res 28: 1385-1401.
    • (1980) Op Res , vol.28 , pp. 1385-1401
    • Dasarathy, B.1    White, L.J.2
  • 4
    • 0025838521 scopus 로고
    • A parametric 1-maximin location problem
    • Erkut E (1991). A parametric 1-maximin location problem. J Opl Res Soc 42: 49-55.
    • (1991) J Opl Res Soc , vol.42 , pp. 49-55
    • Erkut, E.1
  • 5
    • 0020680391 scopus 로고
    • The location of an obnoxious facility with rectangular distances
    • Drezner Z and Wesolowsky GO (1983). The location of an obnoxious facility with rectangular distances. J Reg Sci, 23: 241-248.
    • (1983) J Reg Sci , vol.23 , pp. 241-248
    • Drezner, Z.1    Wesolowsky, G.O.2
  • 6
    • 0024067643 scopus 로고
    • An efficient computational procedure for the rectilinear maximin location problem
    • Melachrinoudis E (1988). An efficient computational procedure for the rectilinear maximin location problem. Tramp Sci 22: 217-223.
    • (1988) Tramp Sci , vol.22 , pp. 217-223
    • Melachrinoudis, E.1
  • 7
    • 0028333580 scopus 로고
    • Is linear programming necessary for a single facility location with maximin of rectilinear distance?
    • Appa GM and Giannikos I (1994). Is linear programming necessary for a single facility location with maximin of rectilinear distance? J Opl Res Soc 45: 97-107.
    • (1994) J Opl Res Soc , vol.45 , pp. 97-107
    • Appa, G.M.1    Giannikos, I.2
  • 8
    • 0029752664 scopus 로고    scopus 로고
    • Rectilinear location revisited
    • White DJ (1996). Rectilinear location revisited. J Opl Res Soc 47: 181-187.
    • (1996) J Opl Res Soc , vol.47 , pp. 181-187
    • White, D.J.1
  • 9
    • 0031140373 scopus 로고    scopus 로고
    • A maxmin location problem with nonconvex feasible region
    • Fernandez F, Puerto J and Rodriguez-Chia AM (1997). A maxmin location problem with nonconvex feasible region. J Opl Res Soc 48: 479-489.
    • (1997) J Opl Res Soc , vol.48 , pp. 479-489
    • Fernandez, F.1    Puerto, J.2    Rodriguez-Chia, A.M.3
  • 11
    • 0020114131 scopus 로고
    • An algorithm for the multiple objective integer linear programming problem
    • Klein D and Hannan E (1982). An algorithm for the multiple objective integer linear programming problem. Eur J Opl Res 9: 378-385.
    • (1982) Eur J Opl Res , vol.9 , pp. 378-385
    • Klein, D.1    Hannan, E.2
  • 12
    • 0008717743 scopus 로고
    • Reidel Publishing Company: The Netherlands
    • Krall AM (1986). Applied Analysis. D. Reidel Publishing Company: The Netherlands.
    • (1986) Applied Analysis. D
    • Krall, A.M.1


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