{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:15:07Z","timestamp":1648505707781},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1016\/0305-0548(85)90047-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"227-235","source":"Crossref","is-referenced-by-count":2,"title":["A Shortest-route approach for optimum aggregation of data with an application to income data"],"prefix":"10.1016","volume":"12","author":[{"given":"Vijay","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"R.","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(85)90047-4_BIB1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.2307\/2287035","article-title":"Optimal grouping of income distribution data","volume":"76","author":"Aghevli","year":"1981","journal-title":"J. Am. Statist. Assoc."},{"key":"10.1016\/0305-0548(85)90047-4_BIB2","doi-asserted-by":"crossref","first-page":"789","DOI":"10.2307\/2281952","article-title":"On grouping for maximum homogeneity","volume":"53","author":"Fisher","year":"1958","journal-title":"J. Am. Statist. Assoc."},{"key":"10.1016\/0305-0548(85)90047-4_BIB3","doi-asserted-by":"crossref","first-page":"622","DOI":"10.2307\/2283542","article-title":"Cluster analysis and mathematical programming","volume":"66","author":"Rao","year":"1971","journal-title":"J. Am. Statist. Assoc."},{"key":"10.1016\/0305-0548(85)90047-4_BIB4","doi-asserted-by":"crossref","first-page":"506","DOI":"10.2307\/2283635","article-title":"Interger programming and the theory of grouping","volume":"64","author":"Vinod","year":"1969","journal-title":"J. Am. Statist. Assoc."},{"key":"10.1016\/0305-0548(85)90047-4_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Mathe."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054885900474?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054885900474?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:51:43Z","timestamp":1552913503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054885900474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0305054885900474"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(85)90047-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}