{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:02:29Z","timestamp":1648540949942},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5921,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0166-218x(96)00082-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"93-102","source":"Crossref","is-referenced-by-count":3,"title":["Minimum dispersion problems"],"prefix":"10.1016","volume":"75","author":[{"given":"Abraham P.","family":"Punnen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.P.","family":"Aneja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00082-0_BIB1","series-title":"The design and analysis of computer algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0166-218X(96)00082-0_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/S0377-2217(96)00142-7","article-title":"Balanced linear programming problem","author":"Ahuja","year":"1985"},{"key":"10.1016\/S0166-218X(96)00082-0_BIB3","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.27.2.324","article-title":"The sharing problem","volume":"27","author":"Brown","year":"1979","journal-title":"Oper. Res"},{"key":"10.1016\/S0166-218X(96)00082-0_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(86)90041-7","article-title":"Most and least uniform spanning trees","volume":"15","author":"Camerini","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB5","first-page":"125","article-title":"A problem in vision that is polynomially solvable","volume":"28","author":"Chandrasekaran","year":"1991","journal-title":"Opsearch"},{"key":"10.1016\/S0166-218X(96)00082-0_BIB6","doi-asserted-by":"crossref","unstructured":"Y. Dai, H. Imai, K. Iwano, N. Katoh, K. Ohtsuka and N. Yoshimura, A new unifying heuristic algorithm for undirected minimum cut problems using minimum range cut algorithms, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(95)00034-O"},{"key":"10.1016\/S0166-218X(96)00082-0_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0167-6377(91)90085-4","article-title":"Minimum deviation and balanced optimization: a unified approach","volume":"10","author":"Duin","year":"1991","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0166-218X(88)90062-5","article-title":"On finding most uniform spanning trees","volume":"20","author":"Galil","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Grotschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(96)00082-0_BIB10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(88)90029-6","article-title":"Minimum deviation problems","volume":"7","author":"Gupta","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB11","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1057\/jors.1984.168","article-title":"Minimizing the range of lateness on a single machine","volume":"35","author":"Gupta","year":"1984","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0166-218X(92)90037-B","article-title":"An \u03b5-approximation scheme for combinatorial problems with minimum variance criterion","volume":"35","author":"Katoh","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1002\/net.3230240705","article-title":"Efficient algorithms for minimum range cut problems","volume":"24","author":"Katoh","year":"1994","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(96)00082-0_BIB14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1057\/jors.1991.32","article-title":"An algorithm for minimizing the range of lateness on a single machine","volume":"42","author":"Lia","year":"1991","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6377(84)90061-0","article-title":"Balanced optimization problems","volume":"3","author":"Martello","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB16","unstructured":"A.P. Punnen and Y.P. Aneja, On k-sum optimization problems, Oper. Res. Lett., to appear."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(81)90017-2","article-title":"Minimization of maximum absolute deviation in integers","volume":"3","author":"Zeitlin","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00082-0_BIB18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(86)90022-3","article-title":"Linear and combinatorial sharing problems","volume":"15","author":"Zimmermann","year":"1986","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000820?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000820?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:28:49Z","timestamp":1556116129000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0166218X96000820"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00082-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}