{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:11:30Z","timestamp":1648987890309},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":[[1987,1]]},"DOI":"10.1016\/0305-0548(87)90010-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"181","source":"Crossref","is-referenced-by-count":0,"title":["Comments on the technical note by bodin"],"prefix":"10.1016","volume":"14","author":[{"given":"Vijay","family":"Aggarwal","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(87)90010-4_BIB1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1080\/01621459.1981.10477596","article-title":"Optimal grouping of income distribution data","volume":"76","author":"Aghevli","year":"1981","journal-title":"JASA"},{"key":"10.1016\/0305-0548(87)90010-4_BIB2","first-page":"343","article-title":"On optimum aggregation of income distribution data","volume":"46","author":"Aggarwal","year":"1984","journal-title":"Sankhya"},{"key":"10.1016\/0305-0548(87)90010-4_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0305-0548(85)90047-4","article-title":"A shortest-route approach for optimum aggregation of data with an application to income data","volume":"12","author":"Aggarwal","year":"1985","journal-title":"Comput. Opns Res."},{"key":"10.1016\/0305-0548(87)90010-4_BIB4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/net.3230020404","article-title":"A graph-theoretic approach to the grouping of ordered data","volume":"2","author":"Bodin","year":"1972","journal-title":"Networks"},{"key":"10.1016\/0305-0548(87)90010-4_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/opre.16.1.205","article-title":"A constrained shortest route problem","volume":"16","author":"Saigal","year":"1968","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(87)90010-4_BIB6","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","article-title":"Cluster analysis and mathematical programming","volume":"66","author":"Rao","year":"1971","journal-title":"JASA"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054887900104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054887900104?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:55:06Z","timestamp":1552913706000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054887900104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0305054887900104"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(87)90010-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}