{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:05:52Z","timestamp":1777539952819,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,4,21]],"date-time":"2012-04-21T00:00:00Z","timestamp":1334966400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10288-012-0202-3","type":"journal-article","created":{"date-parts":[[2012,4,20]],"date-time":"2012-04-20T12:48:27Z","timestamp":1334926107000},"page":"181-192","source":"Crossref","is-referenced-by-count":25,"title":["Min\u2013max and min\u2013max (relative) regret approaches to representatives selection problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Alexandre","family":"Dolgui","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Kovalev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,21]]},"reference":[{"issue":"4","key":"202_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10288-006-0004-6","volume":"4","author":"H Aissi","year":"2006","unstructured":"Aissi H (2006) Approximation and resolution of minmax and minmax regret versions of combinatorial optimization problems. 4OR Q J Oper Res 4(4): 347\u2013350","journal-title":"4OR Q J Oper Res"},{"key":"202_CR2","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.orl.2004.12.002","volume":"33","author":"H Aissi","year":"2005","unstructured":"Aissi H, Bazgan C, Vanderpooten D (2005) Complexity of the min-max and min-max regret assignment problem. Oper Res Lett 33: 634\u2013640","journal-title":"Oper Res Lett"},{"key":"202_CR3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H Aissi","year":"2009","unstructured":"Aissi H, Bazgan C, Vanderpooten D (2009) Minmax and minmax regret versions of combinatorial optimization problems: a survey. Eur J Oper Res 197: 427\u2013438","journal-title":"Eur J Oper Res"},{"key":"202_CR4","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.disopt.2010.03.004","volume":"7","author":"H Aissi","year":"2010","unstructured":"Aissi H, Bazgan C, Vanderpooten D (2010) General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discret Optim 7: 136\u2013148","journal-title":"Discret Optim"},{"issue":"4","key":"202_CR5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10951-010-0183-z","volume":"14","author":"H Aissi","year":"2011","unstructured":"Aissi H, Aloulou MA, Kovalyov MY (2011) Minimizing the number of late jobs on a single machine under due date uncertainty. J Sched 14(4): 351\u2013360","journal-title":"J Sched"},{"issue":"2","key":"202_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I Averbakh","year":"2001","unstructured":"Averbakh I (2001) On the complexity of a class of combinatorial optimization problems with uncertainty. Math Program A 90(2): 263\u2013272","journal-title":"Math Program A"},{"key":"202_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.disopt.2005.07.001","volume":"2","author":"I Averbakh","year":"2005","unstructured":"Averbakh I (2005) Computing and minimizing the relative regret in combinatorial optimization with interval data. Discret Optim 2: 273\u2013287","journal-title":"Discret Optim"},{"key":"202_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10107-003-0474-7","volume":"100","author":"E Conde","year":"2004","unstructured":"Conde E (2004) An improved algorithm for selecting p items with uncertain returns according to the minmax regret criterion. Math Program 100: 345\u2013353","journal-title":"Math Program"},{"issue":"2","key":"202_CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.orl.2005.04.003","volume":"34","author":"V Deineko","year":"2006","unstructured":"Deineko V, Woeginger G (2006) On the robust assignment problem under a fixed number of cost scenarios. Oper Res Lett 34(2): 175\u2013179","journal-title":"Oper Res Lett"},{"key":"202_CR10","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1016\/j.ejor.2006.03.069","volume":"185","author":"A Dolgui","year":"2008","unstructured":"Dolgui A, Guschinsky N, Levin G, Proth JM (2008) Optimisation of multi-position machines and transfer lines. Eur J Oper Res 185: 1375\u20131389","journal-title":"Eur J Oper Res"},{"issue":"2","key":"202_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10288-010-0138-4","volume":"9","author":"L Galli","year":"2011","unstructured":"Galli L (2011) Combinatorial and robust optimisation models and algorithms for railway applications. 4OR Q J Oper Res 9(2): 215\u2013218","journal-title":"4OR Q J Oper Res"},{"key":"202_CR12","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"202_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A Kasperski","year":"2006","unstructured":"Kasperski A, Zielinski P (2006a) An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf Process Lett 97: 177\u2013180","journal-title":"Inf Process Lett"},{"key":"202_CR14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.orl.2005.01.008","volume":"34","author":"A Kasperski","year":"2006","unstructured":"Kasperski A, Zielinski P (2006b) The robust shortest path problem in series-parallel multidigraphs with interval data. Oper Res Lett 34: 69\u201376","journal-title":"Oper Res Lett"},{"key":"202_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10479-009-0564-x","volume":"172","author":"A Kasperski","year":"2009","unstructured":"Kasperski A, Zielinski P (2009a) A randomized algorithm for the min-max selecting items problem with uncertain weights. Ann Oper Res 172: 221\u2013230","journal-title":"Ann Oper Res"},{"key":"202_CR16","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.ipl.2008.10.008","volume":"109","author":"A Kasperski","year":"2009","unstructured":"Kasperski A, Zielinski P (2009b) On the approximability of minmax (regret) network optimization problems. Inf Process Lett 109: 262\u2013266","journal-title":"Inf Process Lett"},{"key":"202_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(95)91591-Z","volume":"17","author":"MY Kovalyov","year":"1995","unstructured":"Kovalyov MY (1995) Improving the complexities of approximation algorithms for optimization problems. Oper Res Lett 17: 85\u201387","journal-title":"Oper Res Lett"},{"key":"202_CR18","first-page":"101","volume":"6","author":"MY Kovalyov","year":"1996","unstructured":"Kovalyov MY (1996) A rounding technique to construct approximation algorithms for knapsack and partition type problems. Appl Math Comput Sci 6: 101\u2013113","journal-title":"Appl Math Comput Sci"},{"key":"202_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, Boston"},{"key":"202_CR20","doi-asserted-by":"crossref","unstructured":"Mirzapour Al-E-Hashem SMJ, Aryanezhad MB, Malekly H, Sadjadi SJ (2009) Mixed model assembly line balancing problem under uncertainty. International Conference on Computers and Industrial Engineering, CIE 2009 , art. no. 5223925, pp. 233\u2013238","DOI":"10.1109\/ICCIE.2009.5223925"},{"issue":"4","key":"202_CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10288-005-0066-x","volume":"3","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM (2005) The robust shortest path problem with interval data via Benders decomposition. 4OR Q J Oper Res 3(4): 315\u2013328","journal-title":"4OR Q J Oper Res"},{"key":"202_CR22","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.ejor.2008.12.036","volume":"200","author":"B Roy","year":"2010","unstructured":"Roy B (2010) Robustness in operational research and decision aiding: a multi-faceted issue. Eur J Oper Res 200: 629\u2013638","journal-title":"Eur J Oper Res"},{"issue":"2","key":"202_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10288-010-0125-9","volume":"8","author":"MG Scutella","year":"2010","unstructured":"Scutella MG, Recchia R (2010) Robust portfolio asset\u00a0allocation and risk measures. 4OR Q J Oper Res 8(2): 113\u2013139","journal-title":"4OR Q J Oper Res"},{"issue":"6","key":"202_CR24","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1108\/03321640910992038","volume":"28","author":"W Xu","year":"2009","unstructured":"Xu W, Xiao T (2009) Robust balancing of mixed model assembly line. COMPEL Int J Comput Math Electr Electron Eng 28(6): 1489\u20131502","journal-title":"COMPEL Int J Comput Math Electr Electron Eng"},{"issue":"6","key":"202_CR25","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","volume":"25","author":"G Yu","year":"1998","unstructured":"Yu G, Yang J (1998) On the robust shortest path problem. Comput Oper Res 25(6): 457\u2013468","journal-title":"Comput Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0202-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-012-0202-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-012-0202-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T16:19:01Z","timestamp":1561652341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-012-0202-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,21]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["202"],"URL":"https:\/\/doi.org\/10.1007\/s10288-012-0202-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,21]]}}}