{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T16:57:32Z","timestamp":1700672252120},"reference-count":14,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1016\/s0305-0548(03)00066-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"1083-1095","source":"Crossref","is-referenced-by-count":3,"title":["Modelling and solving central cycle problems with integer programming"],"prefix":"10.1016","volume":"31","author":[{"given":"L.R.","family":"Foulds","sequence":"first","affiliation":[]},{"given":"J.M.","family":"Wilson","sequence":"additional","affiliation":[]},{"given":"T.","family":"Yamaguchi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00066-2_BIB1","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum location of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00066-2_BIB2","unstructured":"Foulds LR. Graph theory applications, 3rd ed. New York: Springer, 1998. p. 404."},{"key":"10.1016\/S0305-0548(03)00066-2_BIB3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1287\/opre.29.3.523","article-title":"On locating a facility to service areas within a network","volume":"29","author":"Slater","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00066-2_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","article-title":"Locating central paths in a graph","volume":"16","author":"Slater","year":"1982","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(03)00066-2_BIB5","unstructured":"Foulds LR, Yamaguchi T. Cycle centres, medians and centroids in graphs. Memoirs Research Paper Series 1998, Muroran Institute of Technology, Japan."},{"key":"10.1016\/S0305-0548(03)00066-2_BIB6","unstructured":"Schobel A, Hamacher H, Foulds LR. On central cycles in grid graphs. Research Report in Management Mathematics 1999, University of Kaiserlautern, Germany."},{"key":"10.1016\/S0305-0548(03)00066-2_BIB7","first-page":"21","article-title":"Maximizing user convenience and postal service efficiency in post box location","volume":"26","author":"Labbe\u2019","year":"1986","journal-title":"Belgian Journal of Operations Research, Statistics and Computer Science"},{"key":"10.1016\/S0305-0548(03)00066-2_BIB8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","article-title":"The median tour and maximal covering tour problems","volume":"73","author":"Current","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00066-2_BIB9","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/0377-2217(95)00321-5","article-title":"A review of extensive facility location in networks","volume":"95","author":"Mesa","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00066-2_BIB10","series-title":"Fleet management and logistics","article-title":"Path, tree and cycle location","author":"Labbe\u2019","year":"1988"},{"key":"10.1016\/S0305-0548(03)00066-2_BIB11","unstructured":"Lawler EL, Lenstra JK, Rinnnooy Kan AHG, Shmoys DB, editors. The traveling salesman problem, 1985. Chichester: John Wiley and Sons."},{"key":"10.1016\/S0305-0548(03)00066-2_BIB12","unstructured":"Orman A, Williams HP. A survey of formulations of the travelling salesman problem. Research Paper 101, 1999, Faculty of Mathematical Studies, University of Southampton, Southampton, UK."},{"key":"10.1016\/S0305-0548(03)00066-2_BIB13","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1287\/moor.22.1.110","article-title":"The circuit polytope","volume":"22","author":"Bauer","year":"1997","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(03)00066-2_BIB14","unstructured":"Renaud J, Boctor FF, Laporte G. Efficient heuristics for median cycle problems. Journal of the Operational Research Society, 2002; under revision."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000662?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000662?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:26:56Z","timestamp":1553228816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S0305054803000662"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00066-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}