{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:45:01Z","timestamp":1761896701947,"version":"build-2065373602"},"reference-count":32,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"name":"NWO","award":["639.033.403"],"award-info":[{"award-number":["639.033.403"]}]},{"DOI":"10.13039\/501100002749","name":"Federaal Wetenschapsbeleid","doi-asserted-by":"publisher","award":["P7\/36"],"award-info":[{"award-number":["P7\/36"]}],"id":[{"id":"10.13039\/501100002749","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s13675-018-0093-y","type":"journal-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T05:25:36Z","timestamp":1518413136000},"page":"239-266","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust balanced optimization"],"prefix":"10.1016","volume":"6","author":[{"given":"AnnetteM.C.","family":"Ficker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FritsC.R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GerhardJ.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1007\/s13675-018-0093-y_CR1","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"},{"issue":"6","key":"10.1007\/s13675-018-0093-y_CR2","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.orl.2004.12.002","article-title":"Complexity of the min-max and min-max regret assignment problems","volume":"33","author":"Aissi","year":"2005","journal-title":"Oper Res Lett"},{"issue":"2","key":"10.1007\/s13675-018-0093-y_CR3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Min-max and min-max regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10.1007\/s13675-018-0093-y_CR4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","article-title":"Robust convex optimization","volume":"23","author":"Ben-Tal","year":"1998","journal-title":"Math Oper Res"},{"issue":"1","key":"10.1007\/s13675-018-0093-y_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","article-title":"Robust solutions of uncertain linear programs","volume":"25","author":"Ben-Tal","year":"1999","journal-title":"Oper Res Lett"},{"issue":"3","key":"10.1007\/s13675-018-0093-y_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","article-title":"Robust solutions of linear programming problems contaminated with uncertain data","volume":"88","author":"Ben-Tal","year":"2000","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-018-0093-y_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/msom.1050.0081","article-title":"Retailer-supplier flexible commitments contracts: a robust optimization approach","volume":"7","author":"Ben-Tal","year":"2005","journal-title":"Manuf Serv Oper Manag"},{"issue":"1-2","key":"10.1007\/s13675-018-0093-y_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10107-005-0679-z","article-title":"Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems","volume":"107","author":"Ben-Tal","year":"2006","journal-title":"Math Program"},{"year":"2009","series-title":"Robust optimization","author":"Ben-Tal","key":"10.1007\/s13675-018-0093-y_CR9"},{"issue":"1","key":"10.1007\/s13675-018-0093-y_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","article-title":"Robust discrete optimization and network flows","volume":"98","author":"Bertsimas","year":"2003","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-018-0093-y_CR11","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","article-title":"Theory and applications of robust optimization","volume":"53","author":"Bertsimas","year":"2011","journal-title":"SIAM Rev"},{"issue":"2-3","key":"10.1007\/s13675-018-0093-y_CR12","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"},{"issue":"2","key":"10.1007\/s13675-018-0093-y_CR13","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.20053","article-title":"Balanced paths in acyclic networks: tractable cases and related approaches","volume":"45","author":"Cappanera","year":"2005","journal-title":"Networks"},{"key":"10.1007\/s13675-018-0093-y_CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.orl.2005.04.003","article-title":"On the robust assignment problem under a fixed number of cost scenarios","volume":"34","author":"Deineko","year":"2006","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-018-0093-y_CR15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.disopt.2014.08.005","article-title":"Multi-dimensional vector assignment problems","volume":"14","author":"Dokka","year":"2014","journal-title":"Discrete Optim"},{"issue":"2","key":"10.1007\/s13675-018-0093-y_CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1137\/15M1020575","article-title":"Jump: a modeling language for mathematical optimization","volume":"59","author":"Dunning","year":"2017","journal-title":"SIAM Rev"},{"key":"10.1007\/s13675-018-0093-y_CR17","doi-asserted-by":"crossref","unstructured":"Ficker AMC, Spieksma FCR, Woeginger GJ (2018) Robust balanced optimization, KU Leuven, FEB Research report KBI_1802","DOI":"10.2139\/ssrn.3134369"},{"issue":"3","key":"10.1007\/s13675-018-0093-y_CR18","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","article-title":"Recent advances in robust optimization: an overview","volume":"235","author":"Gabrel","year":"2014","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13675-018-0093-y_CR19","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.1007\/s13675-018-0093-y_CR20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.omega.2014.12.006","article-title":"A practical guide to robust optimization","volume":"53","author":"Gorissen","year":"2015","journal-title":"OMEGA"},{"key":"10.1007\/s13675-018-0093-y_CR21","doi-asserted-by":"crossref","unstructured":"Kamura Y, Nakamori M (2014) Modified balanced assignment problem in vector case: System construction problem, In: 2014 international conference on computational science and computational intelligence (CSCI), vol 2. IEEE, pp 52\u201356","DOI":"10.1109\/CSCI.2014.94"},{"issue":"7","key":"10.1007\/s13675-018-0093-y_CR22","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"},{"issue":"2","key":"10.1007\/s13675-018-0093-y_CR23","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.ejor.2017.02.017","article-title":"Exact algorithms for the equitable traveling salesman problem","volume":"261","author":"Kinable","year":"2017","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13675-018-0093-y_CR24","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/net.21497","article-title":"Robust network design: formulations, valid inequalities, and computations","volume":"61","author":"Koster","year":"2013","journal-title":"Networks"},{"year":"1997","series-title":"Robust discrete optimization and its applications","author":"Kouvelis","key":"10.1007\/s13675-018-0093-y_CR25"},{"issue":"5","key":"10.1007\/s13675-018-0093-y_CR26","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1016\/j.cor.2010.09.016","article-title":"The balanced traveling salesman problem","volume":"38","author":"Larusic","year":"2011","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13675-018-0093-y_CR27","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1287\/opre.1120.1049","article-title":"Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations","volume":"60","author":"Lee","year":"2012","journal-title":"Oper Res"},{"issue":"5","key":"10.1007\/s13675-018-0093-y_CR28","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.1007\/s13675-018-0093-y_CR29","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1016\/j.ejor.2014.02.060","article-title":"Robust combinatorial optimization with variable cost uncertainty","volume":"237","author":"Poss","year":"2014","journal-title":"Eur J Oper Res"},{"issue":"9","key":"10.1007\/s13675-018-0093-y_CR30","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0898-1221(99)00119-4","article-title":"Constrained balanced optimization problems","volume":"37","author":"Punnen","year":"1999","journal-title":"Comput Math Appl"},{"issue":"2","key":"10.1007\/s13675-018-0093-y_CR31","first-page":"91","article-title":"Variants of shortest path problems","volume":"6","author":"Turner","year":"2012","journal-title":"Algorithmic Oper Res"},{"issue":"6","key":"10.1007\/s13675-018-0093-y_CR32","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1287\/opre.2014.1314","article-title":"Distributionally robust convex optimization","volume":"62","author":"Wiesemann","year":"2014","journal-title":"Oper Res"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-018-0093-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0093-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001027?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001027?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0093-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:57Z","timestamp":1761882417000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["S2192440621001027"],"URL":"https:\/\/doi.org\/10.1007\/s13675-018-0093-y","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robust balanced optimization","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-018-0093-y","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2018 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}