{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:48:06Z","timestamp":1761292086553},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":[[1991,2]]},"DOI":"10.1016\/0167-6377(91)90085-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"43-48","source":"Crossref","is-referenced-by-count":26,"title":["Minimum deviation and balanced optimization: A unified approach"],"prefix":"10.1016","volume":"10","author":[{"given":"C.W.","family":"Duin","sequence":"first","affiliation":[]},{"given":"A.","family":"Volgenant","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90085-4_BIB1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0020-0190(78)90030-3","article-title":"The min-max spanning tree problem and some extensions","volume":"7","author":"Camerini","year":"1978","journal-title":"Information Processing Lett."},{"key":"10.1016\/0167-6377(91)90085-4_BIB2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(89)90005-9","article-title":"An edge elimination test for the Steiner problem in graphs","volume":"8","author":"Duin","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(91)90085-4_BIB3","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. Math."},{"key":"10.1016\/0167-6377(91)90085-4_BIB4","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0167-6377(91)90085-4_BIB5","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\/0167-6377(91)90085-4_BIB6","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0167-6377(91)90085-4_BIB7","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\/0167-6377(91)90085-4_BIB8","first-page":"259","article-title":"Linear assignment problems","volume":"31","author":"Martello","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(91)90085-4_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro\/1986200402731","article-title":"Optimal traffic assignment in a SS\/TDAMA frame: A new approach by set covering and column generation","volume":"20","author":"Minoux","year":"1986","journal-title":"RAIRO"},{"key":"10.1016\/0167-6377(91)90085-4_BIB10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01589111","article-title":"Solving combinatorial problems with combined min-max-min-sum objective","volume":"45","author":"Minoux","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90085-4_BIB11","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0167-5060(08)70754-4","article-title":"A LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem using Held and Karp's 1-tree relaxation","volume":"1","author":"Smith","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(91)90085-4_BIB12","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(83)90161-3","article-title":"The symmetric traveling salesman problem and edge exchanges in minimal 1-trees","volume":"12","author":"Volgenant","year":"1983","journal-title":"Eur. J. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637791900854?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637791900854?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:26:33Z","timestamp":1552901193000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637791900854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["0167637791900854"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90085-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}