메뉴 건너뛰기




Volumn 122, Issue 1-4, 2003, Pages 163-175

On Center Cycles in Grid Graphs

Author keywords

Center problem; Grid graph; Location of cycles; Network location

Indexed keywords


EID: 0347126408     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1026198523981     Document Type: Article
Times cited : (1)

References (25)
  • 1
    • 0041671509 scopus 로고
    • Optimal Routing and Process Scheduling for a Mobile Service Facility
    • Akinc, U. and K.N. Srikanth. (1992). "Optimal Routing and Process Scheduling for a Mobile Service Facility." Networks 22, 163-183.
    • (1992) Networks , vol.22 , pp. 163-183
    • Akinc, U.1    Srikanth, K.N.2
  • 2
    • 0042634954 scopus 로고
    • Approximation Algorithms for the Geometric Covering Salesman Problem
    • Arkin, E.M. and R. Hassin. (1994). "Approximation Algorithms for the Geometric Covering Salesman Problem." Discrete Applied Mathematics 55, 197-218.
    • (1994) Discrete Applied Mathematics , vol.55 , pp. 197-218
    • Arkin, E.M.1    Hassin, R.2
  • 5
    • 0028377571 scopus 로고
    • The Median Tour and Maximal Covering Tour Problems: Formulations and Heuristics
    • Current, J.R. and D.A. Schilling. (1994). "The Median Tour and Maximal Covering Tour Problems: Formulations and Heuristics." European Journal of Operational Research 73, 114-126.
    • (1994) European Journal of Operational Research , vol.73 , pp. 114-126
    • Current, J.R.1    Schilling, D.A.2
  • 7
    • 84872985713 scopus 로고    scopus 로고
    • On the Circle Closest to a Set of Points
    • California State University, Department of Management Science and Information Systems
    • Drezner, Z., S. Steiner, and G.O. Wesolowsky. (1996). "On the Circle Closest to a Set of Points." Technical Report, California State University, Department of Management Science and Information Systems.
    • (1996) Technical Report
    • Drezner, Z.1    Steiner, S.2    Wesolowsky, G.O.3
  • 9
    • 84873002380 scopus 로고    scopus 로고
    • Modelling and Solving Central Cycle Problems with Integer Programming
    • Department of Management Systems, University of Waikato, New Zealand
    • Foulds, L.R., J.M. Wilson, and T. Yamaguchi. (1999). "Modelling and Solving Central Cycle Problems with Integer Programming." Technical Report 1999-07, Department of Management Systems, University of Waikato, New Zealand.
    • (1999) Technical Report 1999-07
    • Foulds, L.R.1    Wilson, J.M.2    Yamaguchi, T.3
  • 11
    • 0006218433 scopus 로고
    • A Comparative Study of Heuristics for a Two-Level Location-Routing Problem
    • Jacobsen, S.K. and Madsen O. (1980). "A Comparative Study of Heuristics for a Two-Level Location-Routing Problem." European Journal of Operational Research 5, 378-387.
    • (1980) European Journal of Operational Research , vol.5 , pp. 378-387
    • Jacobsen, S.K.1    Madsen, O.2
  • 13
    • 0008515863 scopus 로고    scopus 로고
    • Path, Tree and Cycle Location
    • T.C. Crainic and G. Laporte (eds.). Boston: Kluwer
    • Labbé, M., G. Laporte, and I. Rodriguez-Martin. (1998). "Path, Tree and Cycle Location." In T.C. Crainic and G. Laporte (eds.), Fleet Management and Logistics. Boston: Kluwer, pp. 187-204.
    • (1998) Fleet Management and Logistics , pp. 187-204
    • Labbé, M.1    Laporte, G.2    Rodriguez-Martin, I.3
  • 15
    • 0348177873 scopus 로고    scopus 로고
    • The Ring Star Problem: Polyhedral Analysis and Exact Algorithm
    • Université Libre de Bruxelles
    • Labbé, M., G. Laporte, I. Rodriguez-Martin, and J.J. Salazar. (2001b). "The Ring Star Problem: Polyhedral Analysis and Exact Algorithm." Technical Report, Université Libre de Bruxelles.
    • (2001) Technical Report
    • Labbé, M.1    Laporte, G.2    Rodriguez-Martin, I.3    Salazar, J.J.4
  • 17
    • 0043263378 scopus 로고    scopus 로고
    • A Review of Extensive Facility Location in Networks
    • Mesa, J.A. and T.B. Boffey. (1996). "A Review of Extensive Facility Location in Networks." European Journal of Operational Research 95(3), 592-603.
    • (1996) European Journal of Operational Research , vol.95 , Issue.3 , pp. 592-603
    • Mesa, J.A.1    Boffey, T.B.2
  • 20
    • 0040454920 scopus 로고    scopus 로고
    • Least Squares Fitting of Ellipses and Hyperbolas
    • Späth, H. (1997a). "Least Squares Fitting of Ellipses and Hyperbolas." Computational Statistics 12(3), 329-341.
    • (1997) Computational Statistics , vol.12 , Issue.3 , pp. 329-341
    • Späth, H.1
  • 21
    • 0040651974 scopus 로고    scopus 로고
    • Orthogonal Distance Fitting by Circles and Ellipses
    • Späth, H. (1997b). "Orthogonal Distance Fitting by Circles and Ellipses." Computational Statistics 12(3), 343-354.
    • (1997) Computational Statistics , vol.12 , Issue.3 , pp. 343-354
    • Späth, H.1
  • 23
    • 84873006258 scopus 로고    scopus 로고
    • Linear Programming Techniques for Fitting Circles and Spheres
    • (August), Lausanne
    • Witzgall, C., S.I. Gass, H.H. Harary, and D.R. Shier. (August 1997). "Linear Programming Techniques for Fitting Circles and Spheres." In ISMP '97, Lausanne.
    • (1997) ISMP '97
    • Witzgall, C.1    Gass, S.I.2    Harary, H.H.3    Shier, D.R.4


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