{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:14Z","timestamp":1759847954480},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0167-6377(03)00065-8","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T13:48:54Z","timestamp":1057585734000},"page":"27-30","source":"Crossref","is-referenced-by-count":10,"title":["Lexicographic balanced optimization problems"],"prefix":"10.1016","volume":"32","author":[{"given":"Abraham P.","family":"Punnen","sequence":"first","affiliation":[]},{"given":"Y.P.","family":"Aneja","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(03)00065-8_BIB1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0377-2217(96)00142-7","article-title":"The balanced linear programming problem","volume":"101","author":"Ahuja","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(03)00065-8_BIB2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","article-title":"The minmax spanning tree problem and some extensions","volume":"7","author":"Camerini","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-6377(03)00065-8_BIB3","first-page":"707","article-title":"Most and least uniform spanning trees","volume":"21","author":"Camerini","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(03)00065-8_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0167-6377(99)00013-9","article-title":"Improved general procedures for lexicographic bottleneck problems","volume":"24","author":"Croce","year":"1999","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(03)00065-8_BIB5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1006\/jagm.1996.0841","article-title":"Minimum range balanced cuts via dynamic subset sums","volume":"23","author":"Eppstein","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-6377(03)00065-8_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-6377(03)00065-8_BIB7","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\/S0167-6377(03)00065-8_BIB8","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\/S0167-6377(03)00065-8_BIB9","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":"Liao","year":"1991","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0167-6377(03)00065-8_BIB10","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\/S0167-6377(03)00065-8_BIB11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0041-5553(72)90153-X","article-title":"Lexicographic problems of linear programming","volume":"12","author":"Podinovskiui","year":"1973","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/S0167-6377(03)00065-8_BIB12","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/0377-2217(94)00252-5","article-title":"An O(mlogn) algorithm for the max+sum spanning tree problem","volume":"89","author":"Punnen","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(03)00065-8_BIB13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0167-6377(98)00028-5","article-title":"Lexicographic bottleneck combinatorial problems","volume":"23","author":"Sokkalingam","year":"1998","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(03)00065-8_BIB14","series-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/S0167-6377(03)00065-8_BIB15","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."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000658?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000658?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T08:51:05Z","timestamp":1552899065000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637703000658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0167637703000658"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(03)00065-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}