{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:40:06Z","timestamp":1747579206047,"version":"3.40.5"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1026198523981","type":"journal-article","created":{"date-parts":[[2003,11,3]],"date-time":"2003-11-03T22:50:32Z","timestamp":1067899832000},"page":"163-175","source":"Crossref","is-referenced-by-count":1,"title":["On Center Cycles in Grid Graphs"],"prefix":"10.1007","volume":"122","author":[{"given":"Les R.","family":"Foulds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst W.","family":"Hamacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anita","family":"Sch\u00f6bel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadashi","family":"Yamaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5143612_CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/net.3230220204","volume":"22","author":"U. Akinc","year":"1992","unstructured":"Akinc, U. and K.N. Srikanth. (1992). \u201cOptimal Routing and Process Scheduling for a Mobile Service Facility.\u201d Networks 22, 163\u2013183.","journal-title":"Networks"},{"key":"5143612_CR2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(94)90008-6","volume":"55","author":"E.M. Arkin","year":"1994","unstructured":"Arkin, E.M. and R. Hassin. (1994). \u201cApproximation Algorithms for the Geometric Covering Salesman Problem.\u201d Discrete Applied Mathematics 55, 197\u2013218.","journal-title":"Discrete Applied Mathematics"},{"key":"5143612_CR3","volume-title":"Distance in Graphs","author":"F. Buckley","year":"1990","unstructured":"Buckley, F. and F. Harary. (1990). Distance in Graphs. Reading, MA: Addison-Wesley."},{"key":"5143612_CR4","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"J.R. Current","year":"1989","unstructured":"Current, J.R. and D.A. Schilling. (1989). \u201cThe Covering Salesman Problem.\u201d Transportation Science 23, 208\u2013213.","journal-title":"Transportation Science"},{"key":"5143612_CR5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","volume":"73","author":"J.R. Current","year":"1994","unstructured":"Current, J.R. and D.A. Schilling. (1994). \u201cThe Median Tour and Maximal Covering Tour Problems: Formulations and Heuristics.\u201d European Journal of Operational Research 73, 114\u2013126.","journal-title":"European Journal of Operational Research"},{"key":"5143612_CR6","unstructured":"D\u00edaz-B\u00e1nez, J.M., J.A. Mesa, and A. Sch\u00f6bel. (2002). \u201cContinuous Location of Dimensional Structures.\u201d European Journal of Operational Research. To appear."},{"key":"5143612_CR7","unstructured":"Drezner, Z., S. Steiner, and G.O. Wesolowsky. (1996). \u201cOn the Circle Closest to a Set of Points.\u201d Technical Report, California State University, Department of Management Science and Information Systems."},{"key":"5143612_CR8","volume-title":"Graph Theory Applications","author":"L.R. Foulds","year":"1998","unstructured":"Foulds. L.R. (1998). Graph Theory Applications. Berlin: Springer."},{"key":"5143612_CR9","series-title":"Technical Report","volume-title":"Modelling and Solving Central Cycle Problems with Integer Programming","author":"L.R. Foulds","year":"1999","unstructured":"Foulds, L.R., J.M. Wilson, and T. Yamaguchi. (1999). \u201cModelling and Solving Central Cycle Problems with Integer Programming.\u201d Technical Report 1999\u201307, Department of Management Systems, University of Waikato, New Zealand."},{"key":"5143612_CR10","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NPCompleteness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability \u2014 A Guide to the Theory of NPCompleteness. San Francisco: Freeman."},{"key":"5143612_CR11","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/0377-2217(80)90124-1","volume":"5","author":"S.K. Jacobsen","year":"1980","unstructured":"Jacobsen, S.K. and Madsen O. (1980). \u201cA Comparative Study of Heuristics for a Two-Level Location-Routing Problem.\u201d European Journal of Operational Research 5, 378\u2013387.","journal-title":"European Journal of Operational Research"},{"key":"5143612_CR12","first-page":"21","volume":"26","author":"M. Labb\u00e9","year":"1986","unstructured":"Labb\u00e9, M. and G. Laporte. (1986). \u201cMaximizing User Convenience and Postal Service Efficiency in Post Box Location.\u201d Belgian Journal of Operations Research Statistics and Computer Science 26, 21\u201335.","journal-title":"Belgian Journal of Operations Research Statistics and Computer Science"},{"key":"5143612_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-1-4615-5755-5_9","volume-title":"Fleet Management and Logistics","author":"M. Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., G. Laporte, and I. Rodriguez-Martin. (1998). \u201cPath, Tree and Cycle Location.\u201d In T.C. Crainic and G. Laporte (eds.), Fleet Management and Logistics. Boston: Kluwer, pp. 187\u2013204."},{"key":"5143612_CR14","unstructured":"Labb\u00e9, M., G. Laporte, I. Rodriguez Martin, and J.J. Salazar. (2001a). \u201cThe Median Cycle Problem.\u201d Technical Report 12, Universit\u00e9 Libre de Bruxelles."},{"key":"5143612_CR15","unstructured":"Labb\u00e9, M., G. Laporte, I. Rodriguez-Martin, and J.J. Salazar. (2001b). \u201cThe Ring Star Problem: Polyhedral Analysis and Exact Algorithm.\u201d Technical Report, Universit\u00e9 Libre de Bruxelles."},{"key":"5143612_CR16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/34.75510","volume":"13","author":"V.-B. Le","year":"1991","unstructured":"Le, V.-B. and D.T. Lee. (1991). \u201cOut-of-Roundness Problem Revisited.\u201d IEEE Transactions on Pattern Analysis and Machine Intelligence 13, 217\u2013223.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"5143612_CR17","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/0377-2217(95)00321-5","volume":"95","author":"J.A. Mesa","year":"1996","unstructured":"Mesa, J.A. and T.B. Boffey. (1996). \u201cA Review of Extensive Facility Location in Networks.\u201d European Journal of Operational Research 95(3), 592\u2013603.","journal-title":"European Journal of Operational Research"},{"key":"5143612_CR18","volume-title":"Cycle Location Problems","author":"I. Rodriguez Martin","year":"2000","unstructured":"Rodriguez Martin, I. (2000). \u201cCycle Location Problems.\u201d Ph.D. Thesis, Universidad de La Laguna, Spain."},{"key":"5143612_CR19","volume-title":"Applied Optimization Series","author":"A. Sch\u00f6bel","year":"1999","unstructured":"Sch\u00f6bel, A. (1999). \u201cLocating Lines and Hyperplanes \u2013Theory and Algorithms.\u201d Applied Optimization Series, Vol. 25. Dordrecht: Kluwer Academic."},{"issue":"3","key":"5143612_CR20","first-page":"329","volume":"12","author":"H. Sp\u00e4th","year":"1997","unstructured":"Sp\u00e4th, H. (1997a). \u201cLeast Squares Fitting of Ellipses and Hyperbolas.\u201d Computational Statistics 12(3), 329\u2013341.","journal-title":"Computational Statistics"},{"issue":"3","key":"5143612_CR21","first-page":"343","volume":"12","author":"H. Sp\u00e4th","year":"1997","unstructured":"Sp\u00e4th, H. (1997b). \u201cOrthogonal Distance Fitting by Circles and Ellipses.\u201d Computational Statistics 12(3), 343\u2013354.","journal-title":"Computational Statistics"},{"key":"5143612_CR22","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(89)90039-8","volume":"41","author":"J.A. Ventura","year":"1989","unstructured":"Ventura, J.A. and S. Yeralan. (1989). \u201cThe Minmax Center Estimation Problem.\u201d European Journal of Operational Research 41, 64\u201372.","journal-title":"European Journal of Operational Research"},{"key":"5143612_CR23","unstructured":"Witzgall, C., S.I. Gass, H.H. Harary, and D.R. Shier. (August 1997). \u201cLinear Programming Techniques for Fitting Circles and Spheres.\u201d In ISMP'97, Lausanne."},{"key":"5143612_CR24","first-page":"93","volume":"48","author":"T. Yamaguchi","year":"1998","unstructured":"Yamaguchi, T., L.R. Foulds, and J. Lamb. (1998). \u201cCentral Cycles in Graphs.\u201d MIT Memoirs 48, 93\u201399.","journal-title":"MIT Memoirs"},{"key":"5143612_CR25","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1080\/00207548808948005","volume":"26","author":"S. Yeralan","year":"1988","unstructured":"Yeralan, S. and J.A. Ventura. (1988). \u201cComputerized Roundness Inspection.\u201d International Journal of Production Research 26, 1921\u20131935.","journal-title":"International Journal of Production Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026198523981.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026198523981\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026198523981.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:08:14Z","timestamp":1747577294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026198523981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":25,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5143612"],"URL":"https:\/\/doi.org\/10.1023\/a:1026198523981","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}