{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T14:51:11Z","timestamp":1680706271677},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"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":[[1994,7]]},"DOI":"10.1016\/0305-0548(94)90084-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"707-716","source":"Crossref","is-referenced-by-count":16,"title":["On combined minmax-minsum optimization"],"prefix":"10.1016","volume":"21","author":[{"given":"Abraham P.","family":"Punnen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90084-1_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro\/1986200402731","article-title":"Optimal traffic assignment in a SS\/TDMA frame: a new approach by set covering and column generation","volume":"20","author":"Minoux","year":"1986","journal-title":"RAIRO"},{"key":"10.1016\/0305-0548(94)90084-1_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1051\/ro\/1987210201051","article-title":"A class of combinatorial problems with polynomially solvable large set covering\/partitioning relaxations","volume":"21","author":"Minoux","year":"1987","journal-title":"RAIRO"},{"key":"10.1016\/0305-0548(94)90084-1_BIB3","series-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/0305-0548(94)90084-1_BIB4","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":"Operations Res. Lett."},{"key":"10.1016\/0305-0548(94)90084-1_BIB5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01589111","article-title":"Solving combinatorial problems with combined minmax-minsum objective and applications","volume":"45","author":"Minoux","year":"1989","journal-title":"Mathl Program. Ser. B"},{"key":"10.1016\/0305-0548(94)90084-1_BIB6","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.38.1.178","article-title":"The constrained bottleneck problem in networks","volume":"38","author":"Berman","year":"1990","journal-title":"Operations Res."},{"key":"10.1016\/0305-0548(94)90084-1_BIB7","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1002\/nav.3800330415","article-title":"The minmax transportation problem","volume":"33","author":"Ahuja","year":"1986","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(94)90084-1_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/nav.3800050306","article-title":"The dual simplex algorithm for bounded variables","volume":"5","author":"Wagner","year":"1958","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(94)90084-1_BIB9","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\/0305-0548(94)90084-1_BIB10","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/0377-2217(91)90073-5","article-title":"A linear time algorithm for the maximum capacity path problem","volume":"53","author":"Punnen","year":"1991","journal-title":"Europ. J. Opl Res."},{"key":"10.1016\/0305-0548(94)90084-1_BIB11","series-title":"Linear Programming","author":"Murty","year":"1983"},{"key":"10.1016\/0305-0548(94)90084-1_BIB12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-6377(85)90017-3","article-title":"Minmax linear programming problem","volume":"4","author":"Ahuja","year":"1985","journal-title":"Operations Res. Lett."},{"key":"10.1016\/0305-0548(94)90084-1_BIB13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800200108","article-title":"Parametric analysis of linear programming with upper bounded variables","volume":"20","author":"Panwalker","year":"1973","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(94)90084-1_BIB14","article-title":"Minmax optimization","author":"Punnen","year":"1989"},{"key":"10.1016\/0305-0548(94)90084-1_BIB15","article-title":"The auction algorithm: a distributed relaxation method for solving the assignment problem","author":"Bertsekas","year":"1987"},{"key":"10.1016\/0305-0548(94)90084-1_BIB16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(82)90052-X","article-title":"On solution of discrete bottleneck problems","volume":"4","author":"Tamir","year":"1982","journal-title":"Discr. Appl. Math."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:27:04Z","timestamp":1552915624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0305054894900841"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90084-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}