{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:25:18Z","timestamp":1649172318075},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0377-2217(99)00267-2","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"428-435","source":"Crossref","is-referenced-by-count":3,"title":["Path equipartition in the Chebyshev norm"],"prefix":"10.1016","volume":"123","author":[{"given":"Marco","family":"Liverani","sequence":"first","affiliation":[]},{"given":"Aurora","family":"Morgana","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Simeone","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Storchi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00267-2_BIB1","first-page":"31","article-title":"Un algoritmo di equipartizione e il suo impiego in un problema di contrasto ottico","volume":"3","author":"Aparo","year":"1973","journal-title":"Ricerca Operativa"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB2","unstructured":"E.L. Aparo, B. Simeone, Equipartizione su un grafo: un'applicazione all'informatica medica, in: I. Galligani (Ed.), Applicazioni del Calcolo, CNR, Rome, 1975, pp. 77\u201386"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB3","doi-asserted-by":"crossref","unstructured":"R.I. Becker, I. Lari, M. Lucertini, B. Simeone, Max\u2013min partitioning of grids into connected components, Networks 32 (1998) 115\u2013125","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<115::AID-NET4>3.0.CO;2-E"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0196-6774(83)90039-1","article-title":"Shifting algorithms for tree partitioning with general weighting functions","volume":"4","author":"Becker","year":"1983","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0166-218X(94)00143-2","article-title":"The shifting algorithm technique for the partitioning of trees","volume":"62","author":"Becker","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/322290.322294","article-title":"A shifting algorithm for min\u2013max tree partitioning","volume":"29","author":"Becker","year":"1982","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230200305","article-title":"Fair dissections of spider, worms and caterpillars","volume":"20","author":"De Simone","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB8","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB9","doi-asserted-by":"crossref","unstructured":"M. Lucertini, Y. Perl, B. Simeone, Image enhancement by path partitioning, in: V. Cantoni, S. Levialdi (Eds.), Recent Issues in Image Analysis, Lecture Notes in Computer Science, Springer, Heidelberg, 1989","DOI":"10.1007\/3-540-51815-0_37"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0166-218X(93)90048-S","article-title":"Most uniform path partitioning and its use in image processing","volume":"42","author":"Lucertini","year":"1993","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0167-9473(96)00062-X","article-title":"Clustering on trees","volume":"24","author":"Maravalle","year":"1997","journal-title":"Computational Statistics and Data Analysis"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0166-218X(94)00154-6","article-title":"Partitioning a matrix to minimize the maximum cost","volume":"62","author":"Mingozzi","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/322234.322236","article-title":"Max\u2013min tree partitioning","volume":"28","author":"Perl","year":"1981","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(99)00267-2_BIB14","first-page":"81","volume":"81\/82","author":"Ricca","year":"1997","journal-title":"Political districting: Traps, criteria algorithms and trade-offs, Ricerca Operativa XXVII"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002672?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002672?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:24:49Z","timestamp":1556148289000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0377221799002672"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00267-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}