메뉴 건너뛰기




Volumn 7, Issue 3, 2010, Pages 654-658

A hybrid nested partitions algorithm for banking facility location problems

Author keywords

Banking facility; maximal covering location problem; mixed integer programming; nested partitions algorithm

Indexed keywords

MAXIMAL COVERING LOCATION PROBLEMS; MIXED INTEGER PROGRAMMING; NESTED PARTITIONS; NESTED PARTITIONS ALGORITHM;

EID: 77954387360     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2010.2043430     Document Type: Article
Times cited : (23)

References (20)
  • 2
    • 14844355578 scopus 로고    scopus 로고
    • Near-optimal solutions to large-scale facility location problems
    • F. Barahona and F. A. Chudak, "Near-optimal solutions to large-scale facility location problems," Discrete Opt., vol.2, no.1, pp. 35-50, 2005.
    • (2005) Discrete Opt. , vol.2 , Issue.1 , pp. 35-50
    • Barahona, F.1    Chudak, F.A.2
  • 3
    • 0036568002 scopus 로고    scopus 로고
    • The generalized maximal covering location problem
    • O. Berman and D. Krass, "The generalized maximal covering location problem," Comput. Oper. Res., vol.29, pp. 563-581, 2002.
    • (2002) Comput. Oper. Res. , vol.29 , pp. 563-581
    • Berman, O.1    Krass, D.2
  • 6
    • 0343353880 scopus 로고    scopus 로고
    • A comparison of lagrangean and surrogate relaxations for the maximal covering location problem
    • R. D. Galvaro, L. G. A. Espejo, and B. Boffey, "A comparison of lagrangean and surrogate relaxations for the maximal covering location problem," Eur. J. Oper. Res., vol.124, pp. 377-389, 2000.
    • (2000) Eur. J. Oper. Res. , vol.124 , pp. 377-389
    • Galvaro, R.D.1    Espejo, L.G.A.2    Boffey, B.3
  • 7
    • 30744466687 scopus 로고    scopus 로고
    • The maximal expected coverage relocation problem for emergency vehicles
    • M. Gendreau, G. Laporte, and F. Semet, "The maximal expected coverage relocation problem for emergency vehicles," J. Oper. Res. Soc., vol.57, no.1, pp. 22-28, 2006.
    • (2006) J. Oper. Res. Soc. , vol.57 , Issue.1 , pp. 22-28
    • Gendreau, M.1    Laporte, G.2    Semet, F.3
  • 8
    • 44649120234 scopus 로고    scopus 로고
    • A nearly linear-time approximation scheme for the Euclidean -median problem
    • S. G. Kolliopoulos and S. Rao, "A nearly linear-time approximation scheme for the Euclidean -median problem," SIAM J. Comput., vol.37, no.3, pp. 757-782, 2008.
    • (2008) SIAM J. Comput. , vol.37 , Issue.3 , pp. 757-782
    • Kolliopoulos, S.G.1    Rao, S.2
  • 9
    • 68949191944 scopus 로고    scopus 로고
    • A column generation approach for the maximal covering location problem
    • M. A. Pereira, L. A. N. Lorena, and E. L. F. Senne, "A column generation approach for the maximal covering location problem," Int. Trans. Oper. Res., vol.14, no.4, pp. 349-364, 2007.
    • (2007) Int. Trans. Oper. Res. , vol.14 , Issue.4 , pp. 349-364
    • Pereira, M.A.1    Lorena, L.A.N.2    Senne, E.L.F.3
  • 10
    • 54849158500 scopus 로고    scopus 로고
    • Hybrid nested partitions and mathematical programming approach and its applications
    • L. Pi, Y. Pan, and L. Shi, "Hybrid nested partitions and mathematical programming approach and its applications," IEEE Trans. Autom. Sci. Eng., vol.5, pp. 573-586, 2008.
    • (2008) IEEE Trans. Autom. Sci. Eng. , vol.5 , pp. 573-586
    • Pi, L.1    Pan, Y.2    Shi, L.3
  • 11
    • 34548382065 scopus 로고    scopus 로고
    • A multiperiod set covering location model for dynamic redeployment of ambulances
    • H. K. Rajagopalan, C. Saydam, and J. Xiao, "A multiperiod set covering location model for dynamic redeployment of ambulances," Comput. Oper. Res., vol.35, no.3, pp. 814-826, 2008.
    • (2008) Comput. Oper. Res. , vol.35 , Issue.3 , pp. 814-826
    • Rajagopalan, H.K.1    Saydam, C.2    Xiao, J.3
  • 12
    • 12344323561 scopus 로고    scopus 로고
    • Location analysis: A synthesis and survey
    • C. ReVelle and H. Eiselt, "Location analysis: A synthesis and survey," Eur. J. Oper. Res., vol.165, pp. 1-19, 2005.
    • (2005) Eur. J. Oper. Res. , vol.165 , pp. 1-19
    • Revelle, C.1    Eiselt, H.2
  • 13
    • 34447107938 scopus 로고    scopus 로고
    • Solving the maximal covering location problem with heuristic concentration
    • C. ReVelle, M. Scholssberg, and J. Williams, "Solving the maximal covering location problem with heuristic concentration," Comput. Oper. Res., vol.35, pp. 427-435, 2008.
    • (2008) Comput. Oper. Res. , vol.35 , pp. 427-435
    • Revelle, C.1    Scholssberg, M.2    Williams, J.3
  • 14
    • 33846081870 scopus 로고    scopus 로고
    • A review of hierarchical facility location models
    • G. Sahin and H. Sural, "A review of hierarchical facility location models," Comput. Oper. Res., vol.34, no.8, pp. 2310-2331, 2007.
    • (2007) Comput. Oper. Res. , vol.34 , Issue.8 , pp. 2310-2331
    • Sahin, G.1    Sural, H.2
  • 15
    • 42949178687 scopus 로고    scopus 로고
    • A nested partitions framework for solving large-scale multicommodity facility location problems
    • L. Shi, R. R. Meyer, M. Bozbay, and A. J. Miller, "A nested partitions framework for solving large-scale multicommodity facility location problems," J. Syst. Sci. Syst. Eng., vol.13, no.2, pp. 158-179, 2004.
    • (2004) J. Syst. Sci. Syst. Eng. , vol.13 , Issue.2 , pp. 158-179
    • Shi, L.1    Meyer, R.R.2    Bozbay, M.3    Miller, A.J.4
  • 16
    • 0034179713 scopus 로고    scopus 로고
    • Nested partitions method for global optimization
    • L. Shi and S. Olafsson, "Nested partitions method for global optimization," Oper. Res., vol.48, pp. 390-407, 2000. (Pubitemid 32415966)
    • (2000) Operations Research , vol.48 , Issue.3 , pp. 390-407
    • Shi, L.1    Olafsson, S.2
  • 17
    • 33646348751 scopus 로고    scopus 로고
    • Facility location under uncertainty: A review
    • L. V. Snyder, "Facility location under uncertainty: A review," IIE Trans., vol.38, pp. 547-564, 2006.
    • (2006) IIE Trans. , vol.38 , pp. 547-564
    • Snyder, L.V.1
  • 18
    • 54849148100 scopus 로고    scopus 로고
    • Design of stochastic distribution networks using Lagrangian relaxation
    • G. A. Tanonkou, L. Benyoucef, and X. Xie, "Design of stochastic distribution networks using Lagrangian relaxation," IEEE Trans. Autom. Sci. Eng., vol.5, pp. 597-608, 2008.
    • (2008) IEEE Trans. Autom. Sci. Eng. , vol.5 , pp. 597-608
    • Tanonkou, G.A.1    Benyoucef, L.2    Xie, X.3
  • 19
    • 0042889679 scopus 로고
    • An efficient method for weighted sampling without replacement
    • C. K. Wong and M. C. Easton, "An efficient method for weighted sampling without replacement," SIAM J. Comput., vol.9, no.1, pp. 111-113, 1980.
    • (1980) SIAM J. Comput. , vol.9 , Issue.1 , pp. 111-113
    • Wong, C.K.1    Easton, M.C.2
  • 20
    • 33646734528 scopus 로고    scopus 로고
    • Approximating the two-level facility location problem via a quasi-greedy approach
    • J. Zhang, "Approximating the two-level facility location problem via a quasi-greedy approach," Math. Program., vol.108, no.1, pp. 159-176, 2006.
    • (2006) Math. Program. , vol.108 , Issue.1 , pp. 159-176
    • Zhang, J.1


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