{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:24:08Z","timestamp":1725467048149},"reference-count":37,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1016\/j.ejor.2012.01.056","type":"journal-article","created":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T12:47:32Z","timestamp":1328705252000},"page":"722-728","source":"Crossref","is-referenced-by-count":37,"title":["Lexicographic \u03b1-robustness: An alternative to min\u2013max criteria"],"prefix":"10.1016","volume":"220","author":[{"given":"Rim","family":"Kala\u0131\u00a8","sequence":"first","affiliation":[]},{"given":"Claude","family":"Lamboray","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Vanderpooten","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0005","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2006.03.023","article-title":"Approximation of min\u2013max and min\u2013max regret versions of some combinatorial optimization problems","volume":"179","author":"Aissi","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0010","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Min-max and min\u2013max regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.056_b0015","series-title":"New Trends in Multiple Criteria Decision Analysis","article-title":"Robustness in multi-criteria decision aiding","author":"Aissi","year":"2010"},{"issue":"6","key":"10.1016\/j.ejor.2012.01.056_b0020","doi-asserted-by":"crossref","first-page":"2093","DOI":"10.1016\/j.cor.2006.10.013","article-title":"Scenario relaxation algorithm for finite scenario-based min\u2013max regret and min\u2013max relative regret robust optimization","volume":"35","author":"Assavapokee","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0025","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0167-6377(00)00025-0","article-title":"Minmax regret solutions for minimax optimization problems with uncertainty","volume":"27","author":"Averbakh","year":"2000","journal-title":"Operations Research Letters"},{"issue":"1\u20133","key":"10.1016\/j.ejor.2012.01.056_b0030","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":"Mathematical Programming, Series B"},{"key":"10.1016\/j.ejor.2012.01.056_b0035","series-title":"Flexibility and Robustness in Scheduling","author":"Billaut","year":"2008"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.056_b0040","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.ejor.2005.05.004","article-title":"Choices and kernels in bipolar valued digraphs","volume":"175","author":"Bisdorff","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.056_b0045","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ejor.2011.05.040","article-title":"Locating a competitive facility in the plane with a robustness criterion","volume":"215","author":"Blanquero","year":"2011","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0050","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-E","article-title":"Min\u2013max regret robust 1-median location on a tree","volume":"31","author":"Chen","year":"1998","journal-title":"Networks"},{"issue":"11","key":"10.1016\/j.ejor.2012.01.056_b0055","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1080\/07408179708966416","article-title":"\u03b2-robust scheduling for single-machine systems with uncertain processing times","volume":"29","author":"Daniels","year":"1997","journal-title":"IIE Transactions"},{"issue":"4","key":"10.1016\/j.ejor.2012.01.056_b0060","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0966-8349(98)00036-9","article-title":"\u03b1-reliable p-minimax regret: a new model for strategic facility location modeling","volume":"5","author":"Daskin","year":"1997","journal-title":"Location Science"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.056_b0065","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(98)00307-5","article-title":"Computing improved optimal solutions to max\u2013min flexible constraint satisfaction problems","volume":"118","author":"Dubois","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.056_b0070","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.ejor.2003.10.002","article-title":"Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints","volume":"160","author":"Dubois","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.056_b0075","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1057\/jors.2009.81","article-title":"Robustness and duality in linear programming","volume":"61","author":"Gabrel","year":"2010","journal-title":"Journal of Operational Research Society"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.056_b0080","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02031747","article-title":"A robustness approach to international sourcing","volume":"59","author":"Guti\u00e9rrez","year":"1995","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0085","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0377-2217(95)00160-3","article-title":"A robustness approach to uncapacitated network design problem","volume":"94","author":"Guti\u00e9rrez","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"10.1016\/j.ejor.2012.01.056_b0090","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/S0040-1625(03)00023-4","article-title":"Correspondence to what? coherence to what? what is good scenario-based decision making?","volume":"70","author":"Harries","year":"2003","journal-title":"Technological Forecasting and Social Change"},{"key":"10.1016\/j.ejor.2012.01.056_b0095","unstructured":"R. Kala\u0131\u00a8, Une nouvelle approche de robustesse: application quelques probl\u00e8mes d\u2019optimisation. Phd thesis, LAMSADE, Universit\u00e9 Paris-Dauphine, Paris, France, 2006."},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0100","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1051\/ro\/2010010","article-title":"Lexicographic \u03b1-robustness: an application to the 1-median problem","volume":"44","author":"Kala\u0131\u00a8","year":"2010","journal-title":"RAIRO Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.056_b0105","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1111\/j.1475-3995.2010.00786.x","article-title":"The lexicographic \u03b1-robust knapsack problem","volume":"18","author":"Kala\u0131\u00a8","year":"2011","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0110","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0377-2217(92)90032-5","article-title":"Algorithms for robust single and multiple period layout planning for manufacturing systems","volume":"63","author":"Kouvelis","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.056_b0115","series-title":"Robust Discrete Optimization and its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"key":"10.1016\/j.ejor.2012.01.056_b0120","series-title":"Axioms of Cooperative Decision Making, Chapter Social Welfare Orderings","author":"Moulin","year":"1988"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0125","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","article-title":"Robust optimization of large-scale systems","volume":"43","author":"Mulvey","year":"1995","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.056_b0130","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/S0377-2217(96)00154-3","article-title":"On the lexicographic minimax approach to location problems","volume":"100","author":"Ogryczak","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0135","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0167-9236(00)00131-7","article-title":"Scenario development and practical decision making under uncertainty","volume":"31","author":"Pomerol","year":"2001","journal-title":"Decision Support Systems"},{"key":"10.1016\/j.ejor.2012.01.056_b0140","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1051\/ro\/196802V100571","article-title":"Classement et choix en pr\u00e9sence de points de vue multiples (la m\u00e9thode ELECTRE)","volume":"8","author":"Roy","year":"1968","journal-title":"RIRO"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.056_b0145","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.ejor.2008.12.036","article-title":"Robustness in operational research and decision aiding: a multi-faceted issue","volume":"200","author":"Roy","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.056_b0150","series-title":"Handbook of Multicritreria Analysis","first-page":"3","article-title":"To better respond to the robustness concern in decision aiding: four proposals based on a twofold observation","author":"Roy","year":"2010"},{"issue":"11","key":"10.1016\/j.ejor.2012.01.056_b0155","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1287\/mnsc.30.11.1323","article-title":"Relational systems of preference with one or more pseudo-criteria: some new concepts and results","volume":"30","author":"Roy","year":"1984","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.056_b0160","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/smj.4250140304","article-title":"Multiple scenario development: its conceptual and behavioral foundation","volume":"14","author":"Schoemaker","year":"1993","journal-title":"Strategic Management Journal"},{"issue":"7","key":"10.1016\/j.ejor.2012.01.056_b0165","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/07408170500216480","article-title":"Facility location under uncertainty: a review","volume":"38","author":"Snyder","year":"2006","journal-title":"IIE Transactions"},{"issue":"1","key":"10.1016\/j.ejor.2012.01.056_b0170","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ro:1999104","article-title":"D\u00e9termination d\u2019une p\u00e9riode \u00e9conomique robuste dans le cadre du mod\u00e8le de Wilson","volume":"33","author":"Vallin","year":"1999","journal-title":"RAIRO"},{"issue":"3","key":"10.1016\/j.ejor.2012.01.056_b0175","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1099-1360(199905)8:3<181::AID-MCDA242>3.0.CO;2-P","article-title":"Robust solutions and methods in decision-aid","volume":"8","author":"Vincke","year":"1999","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.056_b0180","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/opre.44.2.407","article-title":"On the max\u2013min 0\u20131 knapsack problem with robust optimization applications","volume":"44","author":"Yu","year":"1996","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2012.01.056_b0185","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","article-title":"On the robust shortest path problem","volume":"25","author":"Yu","year":"1998","journal-title":"Computers & Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722171200094X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722171200094X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T06:56:36Z","timestamp":1543215396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722171200094X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["S037722171200094X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.01.056","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}