Min–max and min–max regret versions of combinatorial optimization problems: A survey
Min–max and min–max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min–max and min–max regret versions of some combinatorial optimization problems: shortest path, spannin...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 197; číslo 2; s. 427 - 438 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
01.09.2009
Elsevier Elsevier Sequoia S.A |
| Edice: | European Journal of Operational Research |
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Min–max and min–max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min–max and min–max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min
s–
t cut, knapsack. Since most of these problems are
NP-hard, we also investigate the approximability of these problems. Furthermore, we present algorithms to solve these problems to optimality. |
|---|---|
| AbstractList | Min–max and min–max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min–max and min–max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min
s–
t cut, knapsack. Since most of these problems are
NP-hard, we also investigate the approximability of these problems. Furthermore, we present algorithms to solve these problems to optimality. Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min s-t cut, knapsack. Since most of these problems are NP-hard, we also investigate the approximability of these problems. Furthermore, we present algorithms to solve these problems to optimality. [PUBLICATION ABSTRACT] Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min s-t cut, knapsack. Since most of these problems are NP-hard, we also investigate the approximability of these problems. Furthermore, we present algorithms to solve these problems to optimality. |
| Author | Bazgan, Cristina Aissi, Hassene Vanderpooten, Daniel |
| Author_xml | – sequence: 1 givenname: Hassene surname: Aissi fullname: Aissi, Hassene email: aissi@lamsade.dauphine.fr – sequence: 2 givenname: Cristina surname: Bazgan fullname: Bazgan, Cristina email: bazgan@lamsade.dauphine.fr – sequence: 3 givenname: Daniel surname: Vanderpooten fullname: Vanderpooten, Daniel email: vdp@lamsade.dauphine.fr |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21374323$$DView record in Pascal Francis http://econpapers.repec.org/article/eeeejores/v_3a197_3ay_3a2009_3ai_3a2_3ap_3a427-438.htm$$DView record in RePEc |
| BookMark | eNp9Uctu1DAUtVCRmBZ-gFWExDLBr8QJYlNVhSKK2IDEznKcG3CU2MH2jBhW_AN_2C_hDlPNgkUtHV9bPuce69xzcuaDB0KeM1oxyppXUwVTiBWntK1oV1HGH5ENaxUvm7ahZ2RDhVIl50w9IecpTZRSVrN6Q75-dP7u95_F_CyMH4rldIvwLUIudhCTCz4VYSxsWHrnTQ7RmbkIa3aL-2UyPhdrDP0MS3pdXBZpG3ewf0oej2ZO8Oy-XpAvb68_X92Ut5_evb-6vC2trJtcAuNqsHykoFpWA7MNZ9S0VEgByjadbaDlMDamR9oIPQUhgY5GDR3rRcPEBXlx7Itf-LGFlPUUttGjpeZUsk7WUiHpw5EUYQWr1-gWE_cacGFskPROC8M6hfsegTF2WNzhiFgRkistRau_5wW7vby3NMmaeYzGW5dOXTkTSgoukMePPBtDShHGE4VRfRibnvTBXx_GptESx4ai9j-RdflfyDkaNz8sfXOUAua9cxB1sg68hcFFsFkPwT0k_wum_7eC |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1007_s10479_025_06509_8 crossref_primary_10_1287_deca_2017_0344 crossref_primary_10_1016_j_ejor_2017_08_013 crossref_primary_10_1109_TASE_2024_3446456 crossref_primary_10_3390_sym13122259 crossref_primary_10_1016_j_tcs_2022_09_026 crossref_primary_10_1016_j_asoc_2018_07_014 crossref_primary_10_1016_j_future_2022_03_015 crossref_primary_10_1016_j_ejor_2019_05_045 crossref_primary_10_1016_j_asoc_2017_10_020 crossref_primary_10_1016_j_ejor_2025_06_010 crossref_primary_10_1016_j_ifacol_2016_07_867 crossref_primary_10_1016_j_robot_2014_10_018 crossref_primary_10_1016_j_tre_2020_102058 crossref_primary_10_1007_s00186_016_0532_6 crossref_primary_10_1007_s10957_013_0319_3 crossref_primary_10_1016_j_cor_2016_12_010 crossref_primary_10_1016_j_disopt_2017_08_006 crossref_primary_10_1007_s40171_025_00458_8 crossref_primary_10_1016_j_apm_2013_08_018 crossref_primary_10_1016_j_asoc_2016_07_004 crossref_primary_10_1287_opre_2021_2159 crossref_primary_10_1016_j_ejor_2021_10_021 crossref_primary_10_1016_j_ejor_2017_12_018 crossref_primary_10_1016_j_jnca_2024_104043 crossref_primary_10_1016_j_ejor_2011_08_029 crossref_primary_10_1016_j_ins_2018_03_045 crossref_primary_10_7737_MSFE_2015_21_1_001 crossref_primary_10_1287_ijoc_2022_1189 crossref_primary_10_1080_24725854_2024_2322695 crossref_primary_10_1016_j_ejor_2014_03_013 crossref_primary_10_1080_19427867_2022_2077004 crossref_primary_10_1080_10286608_2015_1022729 crossref_primary_10_3138_infor_52_4_206 crossref_primary_10_1016_j_cie_2017_05_029 crossref_primary_10_1016_j_gloenvcha_2018_09_006 crossref_primary_10_1016_j_dam_2020_05_017 crossref_primary_10_1016_j_ifacol_2016_07_649 crossref_primary_10_1016_j_knosys_2021_107437 crossref_primary_10_1007_s10288_012_0227_7 crossref_primary_10_1016_j_orl_2022_05_001 crossref_primary_10_1016_j_cie_2021_107119 crossref_primary_10_3390_math9172137 crossref_primary_10_1109_TSMC_2022_3189771 crossref_primary_10_1109_TKDE_2021_3109838 crossref_primary_10_1016_j_cor_2024_106886 crossref_primary_10_1016_j_artint_2019_103203 crossref_primary_10_1016_j_ejor_2023_11_020 crossref_primary_10_1109_JSAC_2023_3242707 crossref_primary_10_1016_j_automatica_2010_10_049 crossref_primary_10_1016_j_ejor_2020_04_018 crossref_primary_10_1016_j_forpol_2019_03_012 crossref_primary_10_1080_10556788_2013_869807 crossref_primary_10_1007_s13675_018_0097_7 crossref_primary_10_1016_j_ejtl_2025_100163 crossref_primary_10_1016_j_wre_2019_100143 crossref_primary_10_1287_ijoc_2023_1276 crossref_primary_10_1007_s10107_020_01482_5 crossref_primary_10_1061__ASCE_IR_1943_4774_0000516 crossref_primary_10_1080_10556788_2016_1215447 crossref_primary_10_1080_03155986_2018_1424445 crossref_primary_10_1016_j_cie_2018_08_007 crossref_primary_10_1016_j_cie_2020_106646 crossref_primary_10_1016_j_ejor_2023_03_019 crossref_primary_10_1007_s10951_015_0418_0 crossref_primary_10_1016_j_ordal_2025_200480 crossref_primary_10_1016_j_tcs_2015_11_025 crossref_primary_10_1016_j_ifacol_2016_07_653 crossref_primary_10_1007_s11590_017_1206_x crossref_primary_10_1016_j_jss_2014_09_039 crossref_primary_10_1016_j_ejor_2022_07_018 crossref_primary_10_1142_S0217595912500558 crossref_primary_10_1016_j_disopt_2017_09_004 crossref_primary_10_1016_j_enpol_2023_113625 crossref_primary_10_1016_j_ijdrr_2023_104027 crossref_primary_10_1002_net_21691 crossref_primary_10_1109_TAES_2025_3543469 crossref_primary_10_1111_poms_13495 crossref_primary_10_1016_j_ejor_2017_02_014 crossref_primary_10_1287_inte_2023_1159 crossref_primary_10_1016_j_ejor_2015_05_074 crossref_primary_10_1016_j_ijpe_2011_02_008 crossref_primary_10_1007_s10479_020_03567_y crossref_primary_10_1016_j_energy_2025_137068 crossref_primary_10_1155_2017_5791796 crossref_primary_10_1080_00207543_2018_1555650 crossref_primary_10_3390_pr11020371 crossref_primary_10_1007_s11081_021_09613_3 crossref_primary_10_1007_s13675_018_0107_9 crossref_primary_10_1016_j_ejor_2009_10_015 crossref_primary_10_1016_j_orl_2014_10_007 crossref_primary_10_1109_TEM_2018_2864132 crossref_primary_10_1080_00207543_2014_887865 crossref_primary_10_1108_EC_01_2021_0061 crossref_primary_10_1016_j_ejor_2018_10_006 crossref_primary_10_1016_j_disopt_2023_100771 crossref_primary_10_1016_j_ejor_2015_10_006 crossref_primary_10_1057_jors_2012_139 crossref_primary_10_1287_trsc_2021_1064 crossref_primary_10_1016_j_ejor_2017_04_058 crossref_primary_10_1007_s10479_019_03263_6 crossref_primary_10_1007_s11590_015_0949_5 crossref_primary_10_1016_j_ejor_2019_07_036 crossref_primary_10_1007_s10878_016_0051_7 crossref_primary_10_1016_j_ecoleng_2015_04_017 crossref_primary_10_1016_j_ejor_2015_05_061 crossref_primary_10_1016_j_orl_2016_03_005 crossref_primary_10_1021_acs_est_4c13659 crossref_primary_10_1109_TR_2012_2221032 crossref_primary_10_1061__ASCE_EY_1943_7897_0000462 crossref_primary_10_5802_ojmo_38 crossref_primary_10_1007_s10732_020_09441_1 crossref_primary_10_1287_ijoc_2013_0568 crossref_primary_10_1007_s10479_014_1618_2 crossref_primary_10_1111_itor_12183 crossref_primary_10_4018_IJSVST_313059 crossref_primary_10_1109_LRA_2023_3250007 crossref_primary_10_1007_s10288_012_0202_3 crossref_primary_10_1016_j_jenvman_2010_12_006 crossref_primary_10_1109_MCI_2020_3039067 crossref_primary_10_3390_app12063034 crossref_primary_10_1016_j_cor_2021_105493 crossref_primary_10_1007_s13132_025_02682_0 crossref_primary_10_1287_opre_2022_2429 crossref_primary_10_1108_03684921311323635 crossref_primary_10_1016_j_cor_2022_106087 crossref_primary_10_1007_s10700_013_9171_z crossref_primary_10_1016_j_cor_2011_09_003 crossref_primary_10_1016_j_ejor_2018_01_056 crossref_primary_10_3390_math8020285 crossref_primary_10_1016_j_tre_2017_08_006 crossref_primary_10_3233_JIFS_190152 crossref_primary_10_1016_j_cor_2015_08_010 crossref_primary_10_1016_j_asoc_2015_04_037 crossref_primary_10_1016_j_asoc_2019_106048 crossref_primary_10_1016_j_ejor_2020_03_052 crossref_primary_10_1287_ijoc_2014_0632 crossref_primary_10_1016_j_tcs_2010_10_006 crossref_primary_10_1016_j_enbuild_2019_109362 crossref_primary_10_1016_j_endm_2018_01_003 crossref_primary_10_1007_s10589_022_00391_x crossref_primary_10_1016_j_cie_2021_107890 crossref_primary_10_1007_s10898_014_0187_x crossref_primary_10_5004_dwt_2020_25844 crossref_primary_10_1016_j_ifacol_2022_09_597 crossref_primary_10_1007_s11081_020_09530_x crossref_primary_10_1016_j_tre_2024_103771 crossref_primary_10_1016_j_jmsy_2019_09_012 crossref_primary_10_1007_s12351_018_0395_0 crossref_primary_10_1016_j_cie_2020_106838 crossref_primary_10_1007_s40070_013_0018_1 crossref_primary_10_1109_JSAC_2020_3000365 crossref_primary_10_1016_j_psep_2024_02_057 crossref_primary_10_1002_net_21815 crossref_primary_10_1007_s10458_011_9188_z crossref_primary_10_1109_ACCESS_2025_3558359 crossref_primary_10_1016_j_cie_2025_111478 crossref_primary_10_1016_j_ejor_2016_10_055 crossref_primary_10_1016_j_orl_2013_08_014 crossref_primary_10_3233_JIFS_212391 crossref_primary_10_1016_j_ejor_2024_10_028 crossref_primary_10_1007_s11750_022_00643_3 crossref_primary_10_1016_j_jairtraman_2020_101979 crossref_primary_10_1016_j_orl_2010_03_002 crossref_primary_10_3390_en15103701 crossref_primary_10_1080_1206212X_2016_1207426 crossref_primary_10_1007_s10696_012_9147_2 crossref_primary_10_1016_j_cor_2018_10_013 crossref_primary_10_1016_j_cor_2018_10_014 crossref_primary_10_1016_j_trb_2015_04_008 crossref_primary_10_1287_ijoo_2019_0021 crossref_primary_10_1016_j_cor_2014_02_007 crossref_primary_10_3390_en11102573 crossref_primary_10_1111_j_1475_3995_2010_00786_x crossref_primary_10_1002_net_21909 crossref_primary_10_1016_j_engstruct_2018_12_039 crossref_primary_10_1007_s11590_024_02170_5 crossref_primary_10_1016_j_cie_2023_109610 crossref_primary_10_1016_j_ijar_2016_02_008 crossref_primary_10_1016_j_cor_2015_08_007 crossref_primary_10_1287_opre_2020_2035 crossref_primary_10_1080_00207543_2020_1789235 crossref_primary_10_1007_s11590_018_1348_5 crossref_primary_10_1080_00207543_2012_751510 crossref_primary_10_1002_net_21473 crossref_primary_10_1016_j_knosys_2014_01_015 crossref_primary_10_1007_s10589_020_00207_w crossref_primary_10_1016_j_cor_2021_105692 crossref_primary_10_1007_s11590_019_01456_3 crossref_primary_10_1007_s11590_020_01626_8 crossref_primary_10_1007_s00453_023_01175_3 crossref_primary_10_1016_j_endm_2018_01_016 crossref_primary_10_1080_00207543_2023_2191143 crossref_primary_10_1007_s10479_020_03926_9 crossref_primary_10_1016_j_ejor_2012_01_056 crossref_primary_10_1016_j_ejor_2015_12_046 crossref_primary_10_1016_j_ejor_2016_05_037 crossref_primary_10_1016_j_ejor_2024_09_036 crossref_primary_10_3390_technologies5030043 crossref_primary_10_1016_j_cie_2020_106491 crossref_primary_10_1016_j_ejor_2009_01_044 crossref_primary_10_1016_j_cie_2024_110752 crossref_primary_10_1016_j_ejor_2017_06_042 crossref_primary_10_1016_j_ejor_2015_02_023 crossref_primary_10_1109_TPWRS_2014_2308477 crossref_primary_10_1016_j_ijar_2011_01_003 crossref_primary_10_1080_23744731_2015_1056657 crossref_primary_10_1007_s13675_018_0103_0 crossref_primary_10_1109_TFUZZ_2011_2159982 crossref_primary_10_1016_j_cor_2016_07_007 crossref_primary_10_1016_j_ejor_2022_11_014 crossref_primary_10_1007_s10288_021_00477_y crossref_primary_10_1016_j_ejor_2023_11_018 crossref_primary_10_1287_ijoc_2021_1156 crossref_primary_10_1007_s10951_019_00599_6 crossref_primary_10_1007_s10614_019_09964_1 crossref_primary_10_1016_j_cor_2017_03_007 crossref_primary_10_1002_net_22143 crossref_primary_10_1007_s10479_020_03863_7 crossref_primary_10_1016_j_energy_2020_116992 crossref_primary_10_1029_2021WR030478 crossref_primary_10_1007_s10479_011_0876_5 crossref_primary_10_1007_s13675_016_0067_x crossref_primary_10_1177_0954405415578723 crossref_primary_10_3390_math10244734 crossref_primary_10_1016_j_ejor_2019_11_065 crossref_primary_10_1007_s00186_020_00712_y crossref_primary_10_1007_s12351_018_0409_y crossref_primary_10_1002_net_21615 crossref_primary_10_1007_s13675_018_0093_y crossref_primary_10_1007_s10479_024_06331_8 crossref_primary_10_1007_s10107_014_0760_6 crossref_primary_10_1016_j_tcs_2014_11_013 crossref_primary_10_1016_j_swevo_2023_101321 crossref_primary_10_1080_1573062X_2022_2154681 crossref_primary_10_1016_j_ress_2022_108584 crossref_primary_10_1007_s13160_012_0075_z crossref_primary_10_1016_j_jprocont_2023_103035 crossref_primary_10_1007_s00170_012_4369_8 crossref_primary_10_1007_s00453_019_00589_2 crossref_primary_10_1016_j_disopt_2010_03_008 crossref_primary_10_1109_TPAMI_2016_2565473 crossref_primary_10_1016_j_ejor_2023_06_042 crossref_primary_10_1007_s10586_022_03592_5 crossref_primary_10_1016_j_disopt_2010_03_004 crossref_primary_10_3233_ICA_180583 crossref_primary_10_1007_s10479_023_05661_3 crossref_primary_10_1016_j_cor_2018_01_009 crossref_primary_10_1016_j_techfore_2019_119850 crossref_primary_10_1016_j_enbuild_2024_114988 crossref_primary_10_3390_en12214098 crossref_primary_10_1016_j_ejor_2012_01_005 crossref_primary_10_1016_j_cma_2023_115938 crossref_primary_10_1016_j_orl_2011_06_013 crossref_primary_10_3389_fvets_2020_00564 crossref_primary_10_1016_j_cor_2022_106117 crossref_primary_10_1016_j_cor_2018_12_021 crossref_primary_10_1016_j_ins_2018_06_016 crossref_primary_10_1016_j_ejor_2019_11_059 crossref_primary_10_1137_23M1595084 crossref_primary_10_1016_j_cor_2017_10_010 crossref_primary_10_1007_s10479_014_1538_1 crossref_primary_10_1007_s11590_013_0655_0 crossref_primary_10_1016_j_asoc_2015_03_058 crossref_primary_10_1145_3570957 crossref_primary_10_1016_j_cor_2010_11_009 crossref_primary_10_1109_TASE_2022_3151611 crossref_primary_10_1109_TCYB_2017_2692963 crossref_primary_10_1080_00207543_2016_1162341 crossref_primary_10_1007_s10878_021_00776_4 crossref_primary_10_1002_net_22121 crossref_primary_10_1080_00051144_2020_1789364 crossref_primary_10_1007_s10479_024_06122_1 crossref_primary_10_1016_j_ipl_2012_10_001 crossref_primary_10_1155_2016_5127253 crossref_primary_10_1016_j_cor_2024_106608 crossref_primary_10_1007_s10100_017_0485_8 crossref_primary_10_1016_j_compchemeng_2017_09_026 crossref_primary_10_1016_j_ejor_2019_09_030 crossref_primary_10_1016_j_tcs_2024_114972 crossref_primary_10_1080_19401493_2018_1526971 crossref_primary_10_1109_TPWRS_2013_2250530 crossref_primary_10_1016_j_fss_2014_12_003 crossref_primary_10_1080_00207543_2020_1766721 crossref_primary_10_1016_j_ijpe_2015_06_006 crossref_primary_10_1007_s10479_021_04462_w |
| Cites_doi | 10.1287/mnsc.41.2.363 10.1287/opre.43.2.264 10.1016/j.orl.2007.11.005 10.1016/S0166-218X(03)00462-1 10.1287/opre.44.2.407 10.1057/jors.1972.72 10.1016/j.orl.2005.01.008 10.1287/mnsc.48.12.1603.445 10.1016/S0167-6377(03)00091-9 10.1016/S0305-0548(03)00114-X 10.1007/PL00011424 10.1016/0377-2217(94)00092-Q 10.1016/S0166-218X(02)00384-0 10.1002/(SICI)1099-1360(199905)8:3<181::AID-MCDA242>3.0.CO;2-P 10.1007/s10107-003-0474-7 10.1016/S0305-0548(97)00085-3 10.1287/opre.1030.0065 10.1007/s10107-003-0396-4 10.1080/07408170008963918 10.1016/j.ejor.2005.01.031 10.1287/trsc.1060.0181 10.1016/j.ejor.2003.07.007 10.1016/j.ipl.2005.11.001 10.1007/s10852-006-9044-3 10.1007/s10288-005-0066-x 10.1016/S0167-6377(01)00078-5 10.1016/j.orl.2005.04.003 10.1016/S0966-8349(98)00033-3 10.1287/ijoc.12.2.104.11897 10.1016/j.ejor.2003.10.008 10.1016/j.orl.2006.09.007 10.1109/ICIF.2005.1591918 10.1016/j.ejor.2004.07.073 10.1007/978-1-4757-2620-6 10.1007/s10107-005-0689-x 10.1016/S0167-6377(00)00025-0 10.1016/j.ejor.2006.03.023 10.1016/j.disopt.2005.07.001 10.1109/SFCS.2000.892068 10.1016/S0167-6377(03)00058-0 10.1057/palgrave.jors.2602284 10.1016/j.ejor.2005.02.060 10.1287/opre.25.6.920 10.1002/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-E 10.1016/S0966-8349(98)00036-9 10.1016/j.orl.2004.07.004 10.1016/j.dam.2005.04.015 10.1016/j.orl.2003.08.002 10.1016/j.orl.2005.12.007 10.1016/j.orl.2004.12.002 10.1287/opre.35.1.70 |
| ContentType | Journal Article |
| Copyright | 2008 Elsevier B.V. 2009 INIST-CNRS Copyright Elsevier Sequoia S.A. Sep 1, 2009 |
| Copyright_xml | – notice: 2008 Elsevier B.V. – notice: 2009 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Sep 1, 2009 |
| DBID | AAYXX CITATION IQODW DKI X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| DOI | 10.1016/j.ejor.2008.09.012 |
| DatabaseName | CrossRef Pascal-Francis RePEc IDEAS RePEc Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business Applied Sciences |
| EISSN | 1872-6860 |
| EndPage | 438 |
| ExternalDocumentID | 1659188761 eeeejores_v_3a197_3ay_3a2009_3ai_3a2_3ap_3a427_438_htm 21374323 10_1016_j_ejor_2008_09_012 S0377221708007625 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c456t-e127dc2f0e7815e1c6210a80343e7c69c6e82ef6ab7dcfeb0e34e0fa7d91b3613 |
| ISICitedReferencesCount | 358 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000264605900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sun Nov 09 07:45:13 EST 2025 Wed Aug 18 03:50:56 EDT 2021 Mon Jul 21 09:15:58 EDT 2025 Sat Nov 29 01:40:56 EST 2025 Tue Nov 18 22:11:22 EST 2025 Fri Feb 23 02:27:49 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Robustness Min–max Min–max regret Approximation Combinatorial optimization Complexity Spanning tree Minimax method NP hard problem Shortest path Min-max Knapsack problem Min-max regret |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c456t-e127dc2f0e7815e1c6210a80343e7c69c6e82ef6ab7dcfeb0e34e0fa7d91b3613 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 204194547 |
| PQPubID | 45678 |
| PageCount | 12 |
| ParticipantIDs | proquest_journals_204194547 repec_primary_eeeejores_v_3a197_3ay_3a2009_3ai_3a2_3ap_3a427_438_htm pascalfrancis_primary_21374323 crossref_primary_10_1016_j_ejor_2008_09_012 crossref_citationtrail_10_1016_j_ejor_2008_09_012 elsevier_sciencedirect_doi_10_1016_j_ejor_2008_09_012 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-09-01 |
| PublicationDateYYYYMMDD | 2009-09-01 |
| PublicationDate_xml | – month: 09 year: 2009 text: 2009-09-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationSeriesTitle | European Journal of Operational Research |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2009 |
| Publisher | Elsevier B.V Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Averbakh (bib10) 2000; 27 Daskin, Hesse, ReVelle (bib26) 1997; 5 Kasperski (bib36) 2005; 33 Rosenhead, Elton, Gupta (bib56) 1972; 23 Aissi, Bazgan, Vanderpooten (bib1) 2005; 33 Montemanni (bib48) 2007; 6 Aloulou, Della Croce (bib6) 2008; 36 Aron, Van Hentenryck (bib9) 2004; 32 Averbakh, Lebedev (bib18) 2004; 138 Yu, Yang (bib65) 1998; 25 Averbakh (bib12) 2003; 127 R. Kalai, M.A. Aloulou, P. Vallin, D. Vanderpooten, Robust 1-median location problem on a tree, in: Proceedings of Third Edition of the Operational Research Peripatetic Postgraduate Programme (ORP3 2005), Valencia, Spain, 2005, pp. 201–212. Aissi, Bazgan, Vanderpooten (bib2) 2005; vol. 3827 Roy (bib57) 1998; 23 Mulvey, Vanderbei, Zenios (bib54) 1995; 43 Carr, Greenberg, Hart, Lauer, Lin, Morrison, Phillips (bib22) 2006; 107 Averbakh (bib11) 2001; 90 Kouvelis, Daniels, Vairaktarakis (bib42) 2000; 32 Inuiguchi, Sakawa (bib33) 1995; 86 A. Kasperski, P. Zieliński, On the approximability of minmax (regret) network optimization problems, 2008. Mausser, Laguna (bib46) 1998; 5 . J.P. Watson, W.E. Hart, R. Murray, Formulation and optimization of robust sensor placement problems for contaminant warning systems. Technical report, 2006. Yaman, Karaşan, Pinar (bib63) 2001; 29 Averbakh (bib15) 2006; 169 O.E. Karaşan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, 2001. Garey, Johnson (bib31) 1979 I.D. Aron, P. Van Hentenryck, A constraint satisfaction approach to the robust spanning tree problem with interval data, in: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, Edmonton, Canada, 2002, pp. 18–25. A. Dodonova, Y. Khoroshilov, Applications of regret theory to asset pricing, Technical report, University of Ottawa, 2005. Kazakci, Rozakis, Vanderpooten (bib41) 2007; 58 Kasperski, Zieliński (bib37) 2006; 97 Kouvelis, Yu (bib43) 1997 C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources. in: IEEE Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, California, USA, 2000, pp. 86–92. Mausser, Laguna (bib45) 1998; 117 Aissi, Bazgan, Vanderpooten (bib3) 2006; vol. 4112 Montemanni, Gambardella (bib50) 2004; 31 Averbakh (bib14) 2005; 2 H. Aissi, D. Vanderpooten, J.M. Vanpeperstraete, Robust approaches for the data association problem, in: Proceedings of the Eigth International Conference on Information Fusion (FUSION 2005), Philadelphia, USA, 2005. p. 6. Bertsimas, Sim (bib20) 2003; 98 Sahni (bib58) 1977; 25 Kasperski, Zieliński (bib39) 2007; 35 Yu (bib64) 1996; 44 Vincke (bib60) 1999; 8 Daniels, Kouvelis (bib25) 1995; 41 Averbakh, Lebedev (bib19) 2005; 160 Ehrgott (bib29) 2005 Kasperski, Zieliński (bib38) 2006; 34 Averbakh, Berman (bib16) 1997; 5 Hites, De Smet, Risse, Salazar-Neumann, Vincke (bib32) 2006; 174 Erlebach, Kellerer, Pferschy (bib30) 2002; 48 Salazar-Neumann (bib59) 2007; 35 Armon, Zwick (bib7) 2004; vol. 3341 Chen, Lin (bib23) 1998; 31 Montemanni, Gambardella, Donati (bib53) 2004; 32 Warburton (bib61) 1987; 35 Deineko, Woeginger (bib27) 2006; 34 Montemanni, Barta, Mastrolilli, Gambardella (bib49) 2007; 41 Montemanni, Gambardella (bib51) 2005; 161 Aissi, Bazgan, Vanderpooten (bib4) 2007; 179 Conde (bib24) 2003; 100 Averbakh (bib13) 2004; 32 Montemanni (bib47) 2006; 174 Averbakh, Berman (bib17) 2000; 12 Lebedev, Averbakh (bib44) 2006; 154 Montemanni, Gambardella (bib52) 2005; 3 Bertsimas, Sim (bib21) 2004; 52 Hites (10.1016/j.ejor.2008.09.012_bib32) 2006; 174 10.1016/j.ejor.2008.09.012_bib40 Lebedev (10.1016/j.ejor.2008.09.012_bib44) 2006; 154 Chen (10.1016/j.ejor.2008.09.012_bib23) 1998; 31 Warburton (10.1016/j.ejor.2008.09.012_bib61) 1987; 35 Mausser (10.1016/j.ejor.2008.09.012_bib46) 1998; 5 Yu (10.1016/j.ejor.2008.09.012_bib65) 1998; 25 Averbakh (10.1016/j.ejor.2008.09.012_bib15) 2006; 169 Kasperski (10.1016/j.ejor.2008.09.012_bib36) 2005; 33 Aron (10.1016/j.ejor.2008.09.012_bib9) 2004; 32 Daskin (10.1016/j.ejor.2008.09.012_bib26) 1997; 5 Sahni (10.1016/j.ejor.2008.09.012_bib58) 1977; 25 10.1016/j.ejor.2008.09.012_bib5 Kouvelis (10.1016/j.ejor.2008.09.012_bib43) 1997 Kasperski (10.1016/j.ejor.2008.09.012_bib39) 2007; 35 Yu (10.1016/j.ejor.2008.09.012_bib64) 1996; 44 Aissi (10.1016/j.ejor.2008.09.012_bib2) 2005; vol. 3827 10.1016/j.ejor.2008.09.012_bib8 Deineko (10.1016/j.ejor.2008.09.012_bib27) 2006; 34 Carr (10.1016/j.ejor.2008.09.012_bib22) 2006; 107 Averbakh (10.1016/j.ejor.2008.09.012_bib11) 2001; 90 Averbakh (10.1016/j.ejor.2008.09.012_bib16) 1997; 5 Garey (10.1016/j.ejor.2008.09.012_bib31) 1979 Kouvelis (10.1016/j.ejor.2008.09.012_bib42) 2000; 32 10.1016/j.ejor.2008.09.012_bib55 Aloulou (10.1016/j.ejor.2008.09.012_bib6) 2008; 36 Aissi (10.1016/j.ejor.2008.09.012_bib1) 2005; 33 Bertsimas (10.1016/j.ejor.2008.09.012_bib21) 2004; 52 Averbakh (10.1016/j.ejor.2008.09.012_bib18) 2004; 138 Montemanni (10.1016/j.ejor.2008.09.012_bib51) 2005; 161 Mausser (10.1016/j.ejor.2008.09.012_bib45) 1998; 117 Armon (10.1016/j.ejor.2008.09.012_bib7) 2004; vol. 3341 10.1016/j.ejor.2008.09.012_bib62 Vincke (10.1016/j.ejor.2008.09.012_bib60) 1999; 8 Daniels (10.1016/j.ejor.2008.09.012_bib25) 1995; 41 Montemanni (10.1016/j.ejor.2008.09.012_bib53) 2004; 32 Kazakci (10.1016/j.ejor.2008.09.012_bib41) 2007; 58 Aissi (10.1016/j.ejor.2008.09.012_bib3) 2006; vol. 4112 Yaman (10.1016/j.ejor.2008.09.012_bib63) 2001; 29 Averbakh (10.1016/j.ejor.2008.09.012_bib12) 2003; 127 Ehrgott (10.1016/j.ejor.2008.09.012_bib29) 2005 Rosenhead (10.1016/j.ejor.2008.09.012_bib56) 1972; 23 Averbakh (10.1016/j.ejor.2008.09.012_bib13) 2004; 32 10.1016/j.ejor.2008.09.012_bib28 Conde (10.1016/j.ejor.2008.09.012_bib24) 2003; 100 Inuiguchi (10.1016/j.ejor.2008.09.012_bib33) 1995; 86 Montemanni (10.1016/j.ejor.2008.09.012_bib47) 2006; 174 Averbakh (10.1016/j.ejor.2008.09.012_bib10) 2000; 27 Mulvey (10.1016/j.ejor.2008.09.012_bib54) 1995; 43 Montemanni (10.1016/j.ejor.2008.09.012_bib52) 2005; 3 Montemanni (10.1016/j.ejor.2008.09.012_bib48) 2007; 6 Averbakh (10.1016/j.ejor.2008.09.012_bib17) 2000; 12 Bertsimas (10.1016/j.ejor.2008.09.012_bib20) 2003; 98 Montemanni (10.1016/j.ejor.2008.09.012_bib49) 2007; 41 Montemanni (10.1016/j.ejor.2008.09.012_bib50) 2004; 31 Aissi (10.1016/j.ejor.2008.09.012_bib4) 2007; 179 Erlebach (10.1016/j.ejor.2008.09.012_bib30) 2002; 48 10.1016/j.ejor.2008.09.012_bib35 Kasperski (10.1016/j.ejor.2008.09.012_bib38) 2006; 34 10.1016/j.ejor.2008.09.012_bib34 Averbakh (10.1016/j.ejor.2008.09.012_bib14) 2005; 2 Roy (10.1016/j.ejor.2008.09.012_bib57) 1998; 23 Salazar-Neumann (10.1016/j.ejor.2008.09.012_bib59) 2007; 35 Averbakh (10.1016/j.ejor.2008.09.012_bib19) 2005; 160 Kasperski (10.1016/j.ejor.2008.09.012_bib37) 2006; 97 |
| References_xml | – volume: 174 start-page: 1479 year: 2006 end-page: 1490 ident: bib47 article-title: A Benders decomposition approach for the robust spanning tree with interval data publication-title: European Journal of Operational Research – volume: vol. 3827 start-page: 789 year: 2005 end-page: 798 ident: bib2 article-title: Min–max (regret) versions of cut problems publication-title: Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC 2005) – volume: 117 start-page: 57 year: 1998 end-page: 174 ident: bib45 article-title: A heuristic to minimax absolute regret for linear programs with interval objective function coefficients publication-title: European Journal of Operational Research – volume: 52 start-page: 35 year: 2004 end-page: 53 ident: bib21 article-title: The price of robustness publication-title: Operations Research – volume: 31 start-page: 93 year: 1998 end-page: 103 ident: bib23 article-title: Min–max regret robust 1-median location on a tree publication-title: Networks – year: 1979 ident: bib31 article-title: Computers and intractability: A guide to the theory of NP-completeness – volume: 179 start-page: 281 year: 2007 end-page: 290 ident: bib4 article-title: Approximation of min–max and min–max regret versions of some combinatorial optimization problems publication-title: European Journal of Operational Research – volume: 5 start-page: 227 year: 1997 end-page: 246 ident: bib26 publication-title: Location Science – reference: A. Kasperski, P. Zieliński, On the approximability of minmax (regret) network optimization problems, 2008. – volume: vol. 4112 start-page: 428 year: 2006 end-page: 438 ident: bib3 article-title: Approximating min–max (regret) versions of some polynomial problems publication-title: Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON 2006) – volume: 6 start-page: 287 year: 2007 end-page: 296 ident: bib48 article-title: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data publication-title: Journal of Mathematical Modelling and Algorithms – volume: 100 start-page: 345 year: 2003 end-page: 353 ident: bib24 article-title: An improved algorithm for selecting p items with uncertain returns according to the min–max-regret criterion publication-title: Mathematical Programming A – volume: 43 start-page: 264 year: 1995 end-page: 281 ident: bib54 article-title: Robust optimization of large-scale systems publication-title: Operations Research – volume: 35 start-page: 525 year: 2007 end-page: 532 ident: bib39 article-title: On the existence of an fptas for minmax regret combinatorial optimization problems with interval data publication-title: Operations Research Letters – volume: 33 start-page: 431 year: 2005 end-page: 436 ident: bib36 article-title: Minimizing maximal regret in single machine sequencing problem with maximum lateness criterion publication-title: Operations Research Letters – volume: 31 start-page: 1667 year: 2004 end-page: 1680 ident: bib50 article-title: An exact algorithm for the robust shortest path problem with interval data publication-title: Computer and Operations Research – volume: 35 start-page: 70 year: 1987 end-page: 79 ident: bib61 article-title: Approximation of Pareto optima in multiple-objective, shortest-path problems publication-title: Operations Research – volume: 97 start-page: 177 year: 2006 end-page: 180 ident: bib37 article-title: An approximation algorithm for interval data minmax regret combinatorial optimization problems publication-title: Information Processing Letters – volume: 27 start-page: 57 year: 2000 end-page: 65 ident: bib10 article-title: Minmax regret solutions for minimax optimization problems with uncertainty publication-title: Operations Research Letters – volume: 36 start-page: 338 year: 2008 end-page: 342 ident: bib6 article-title: Complexity of single machine scheduling problems under scenario-based uncertainty publication-title: Operations Research Letters – reference: R. Kalai, M.A. Aloulou, P. Vallin, D. Vanderpooten, Robust 1-median location problem on a tree, in: Proceedings of Third Edition of the Operational Research Peripatetic Postgraduate Programme (ORP3 2005), Valencia, Spain, 2005, pp. 201–212. – volume: 25 start-page: 920 year: 1977 end-page: 936 ident: bib58 article-title: General techniques for combinatorial approximation publication-title: Operations Research – volume: 41 start-page: 363 year: 1995 end-page: 376 ident: bib25 article-title: Robust scheduling to hedge against processing time uncertainty in single-stage production publication-title: Management Science – volume: 35 start-page: 17 year: 2007 end-page: 22 ident: bib59 article-title: The robust minimum spanning tree problem: Compact and convex uncertainty publication-title: Operations Research Letters – volume: 58 start-page: 1470 year: 2007 end-page: 1479 ident: bib41 article-title: Energy crop supply in france: A min–max regret approach publication-title: Journal of the Operational Research Society – year: 1997 ident: bib43 article-title: Robust discrete optimization and its applications – volume: 160 start-page: 227 year: 2005 end-page: 231 ident: bib19 article-title: On the complexity of minmax regret linear programming publication-title: European Journal of Operational Research – volume: 48 start-page: 1603 year: 2002 end-page: 1612 ident: bib30 article-title: Approximating multiobjective knapsack problems publication-title: Management Science – reference: . – volume: 8 start-page: 181 year: 1999 end-page: 187 ident: bib60 article-title: Robust solutions and methods in decision-aid publication-title: Journal of Multicriteria Decision Analysis – reference: C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources. in: IEEE Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, California, USA, 2000, pp. 86–92. – volume: 23 start-page: 413 year: 1972 end-page: 431 ident: bib56 article-title: Robustness and optimality as criteria for strategic decisions publication-title: Operational Research Quarterly – volume: 138 start-page: 289 year: 2004 end-page: 301 ident: bib18 article-title: Interval data min–max regret network optimization problems publication-title: Discrete Applied Mathematics – volume: 32 start-page: 225 year: 2004 end-page: 232 ident: bib53 article-title: A branch and bound algorithm for the robust shortest path problem with interval data publication-title: Operations Research Letters – volume: 5 start-page: 398 year: 1998 end-page: 403 ident: bib46 article-title: A new mixed integer formulation for the maximum regret problem publication-title: International Transaction on Operations Research – volume: 154 start-page: 2167 year: 2006 end-page: 2177 ident: bib44 article-title: Complexity of minimizing the total flow time with interval data and minmax regret criterion publication-title: Discrete Applied Mathematics – volume: 41 start-page: 366 year: 2007 end-page: 381 ident: bib49 article-title: The robust traveling salesman problem with interval data publication-title: Transportation Science – volume: 5 start-page: 247 year: 1997 end-page: 254 ident: bib16 article-title: Minimax regret p-center location on a network with demand uncertainty publication-title: Location Science – reference: O.E. Karaşan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, 2001. – volume: 3 start-page: 315 year: 2005 end-page: 328 ident: bib52 article-title: The robust shortest path problem with interval data via Benders decomposition publication-title: 4OR – volume: 44 start-page: 407 year: 1996 end-page: 415 ident: bib64 article-title: On the max–min 0-1 knapsack problem with robust optimization applications publication-title: Operations Research – year: 2005 ident: bib29 article-title: Multicriteria Optimization – volume: 33 start-page: 634 year: 2005 end-page: 640 ident: bib1 article-title: Complexity of the min–max and min–max regret assignment problem publication-title: Operations Research Letters – volume: 32 start-page: 36 year: 2004 end-page: 40 ident: bib9 article-title: On the complexity of the robust spanning tree with interval data publication-title: Operations Research Letters – volume: 174 start-page: 322 year: 2006 end-page: 332 ident: bib32 article-title: About the applicability of mcda to some robustness problems publication-title: European Journal of Operational Research – volume: 86 start-page: 526 year: 1995 end-page: 536 ident: bib33 article-title: Minimax regret solution to linear programming problems with interval objective function publication-title: European Journal of Operational Research – volume: 34 start-page: 175 year: 2006 end-page: 179 ident: bib27 article-title: On the robust assignment problem under a fixed number of cost scenarios publication-title: Operations Research Letters – volume: vol. 3341 start-page: 65 year: 2004 end-page: 76 ident: bib7 article-title: Multicriteria global minimum cuts publication-title: Proceedings of the 15th International Symposium on Algorithms and Complexity (ISAAC 2004) – reference: I.D. Aron, P. Van Hentenryck, A constraint satisfaction approach to the robust spanning tree problem with interval data, in: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, Edmonton, Canada, 2002, pp. 18–25. – reference: H. Aissi, D. Vanderpooten, J.M. Vanpeperstraete, Robust approaches for the data association problem, in: Proceedings of the Eigth International Conference on Information Fusion (FUSION 2005), Philadelphia, USA, 2005. p. 6. – volume: 98 start-page: 49 year: 2003 end-page: 71 ident: bib20 article-title: Robust discrete optimization and network flows publication-title: Mathematical Programming B – reference: A. Dodonova, Y. Khoroshilov, Applications of regret theory to asset pricing, Technical report, University of Ottawa, 2005. – volume: 161 start-page: 771 year: 2005 end-page: 779 ident: bib51 article-title: A branch and bound algorithm for the robust spanning tree problem with interval data publication-title: European Journal of Operational Research – volume: 29 start-page: 31 year: 2001 end-page: 40 ident: bib63 article-title: The robust spanning tree problem with interval data publication-title: Operations Research Letters – volume: 90 start-page: 263 year: 2001 end-page: 272 ident: bib11 article-title: On the complexity of a class of combinatorial optimization problems with uncertainty publication-title: Mathematical Programming A – volume: 23 start-page: 141 year: 1998 end-page: 160 ident: bib57 article-title: A missing link in publication-title: Foundations of Computing and Decision Sciences – volume: 107 start-page: 337 year: 2006 end-page: 356 ident: bib22 article-title: Robust optimization of contaminant sensor placement for community water systems publication-title: Mathematical Programming B – volume: 25 start-page: 457 year: 1998 end-page: 468 ident: bib65 article-title: On the robust shortest path publication-title: Computers and Operations Research – volume: 32 start-page: 421 year: 2000 end-page: 432 ident: bib42 article-title: Robust scheduling of a two-machine flow shop with uncertain processing times publication-title: IIE Transactions – volume: 12 start-page: 104 year: 2000 end-page: 110 ident: bib17 article-title: Minmax regret median location on a network underuncertainty publication-title: INFORMS Journal on Computing – volume: 169 start-page: 761 year: 2006 end-page: 766 ident: bib15 article-title: The minmax regret permutation flow shop problem with two jobs publication-title: European Journal of Operational Research – reference: J.P. Watson, W.E. Hart, R. Murray, Formulation and optimization of robust sensor placement problems for contaminant warning systems. Technical report, 2006. – volume: 127 start-page: 505 year: 2003 end-page: 522 ident: bib12 article-title: Complexity of robust single facility location problems on networks with uncertain edge lengths publication-title: Discrete Applied Mathematics – volume: 2 start-page: 273 year: 2005 end-page: 287 ident: bib14 article-title: Computing and minimizing the relative regret in combinatorial optimization with interval data publication-title: Discrete Optimization – volume: 34 start-page: 69 year: 2006 end-page: 76 ident: bib38 article-title: The robust shortest path problem in series-parallel multigraphs with interval data publication-title: Operations Research Letters – volume: 32 start-page: 174 year: 2004 end-page: 180 ident: bib13 article-title: Minmax regret linear resource allocation problems publication-title: Operations Research Letters – volume: 41 start-page: 363 issue: 2 year: 1995 ident: 10.1016/j.ejor.2008.09.012_bib25 article-title: Robust scheduling to hedge against processing time uncertainty in single-stage production publication-title: Management Science doi: 10.1287/mnsc.41.2.363 – volume: 43 start-page: 264 issue: 2 year: 1995 ident: 10.1016/j.ejor.2008.09.012_bib54 article-title: Robust optimization of large-scale systems publication-title: Operations Research doi: 10.1287/opre.43.2.264 – year: 2005 ident: 10.1016/j.ejor.2008.09.012_bib29 – volume: vol. 4112 start-page: 428 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib3 article-title: Approximating min–max (regret) versions of some polynomial problems – volume: 36 start-page: 338 issue: 3 year: 2008 ident: 10.1016/j.ejor.2008.09.012_bib6 article-title: Complexity of single machine scheduling problems under scenario-based uncertainty publication-title: Operations Research Letters doi: 10.1016/j.orl.2007.11.005 – ident: 10.1016/j.ejor.2008.09.012_bib34 – volume: 138 start-page: 289 issue: 3 year: 2004 ident: 10.1016/j.ejor.2008.09.012_bib18 article-title: Interval data min–max regret network optimization problems publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(03)00462-1 – volume: 44 start-page: 407 issue: 2 year: 1996 ident: 10.1016/j.ejor.2008.09.012_bib64 article-title: On the max–min 0-1 knapsack problem with robust optimization applications publication-title: Operations Research doi: 10.1287/opre.44.2.407 – volume: 23 start-page: 413 issue: 4 year: 1972 ident: 10.1016/j.ejor.2008.09.012_bib56 article-title: Robustness and optimality as criteria for strategic decisions publication-title: Operational Research Quarterly doi: 10.1057/jors.1972.72 – volume: 34 start-page: 69 issue: 1 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib38 article-title: The robust shortest path problem in series-parallel multigraphs with interval data publication-title: Operations Research Letters doi: 10.1016/j.orl.2005.01.008 – volume: 48 start-page: 1603 issue: 12 year: 2002 ident: 10.1016/j.ejor.2008.09.012_bib30 article-title: Approximating multiobjective knapsack problems publication-title: Management Science doi: 10.1287/mnsc.48.12.1603.445 – volume: 32 start-page: 174 issue: 2 year: 2004 ident: 10.1016/j.ejor.2008.09.012_bib13 article-title: Minmax regret linear resource allocation problems publication-title: Operations Research Letters doi: 10.1016/S0167-6377(03)00091-9 – ident: 10.1016/j.ejor.2008.09.012_bib40 – volume: 31 start-page: 1667 issue: 10 year: 2004 ident: 10.1016/j.ejor.2008.09.012_bib50 article-title: An exact algorithm for the robust shortest path problem with interval data publication-title: Computer and Operations Research doi: 10.1016/S0305-0548(03)00114-X – volume: 90 start-page: 263 issue: 2 year: 2001 ident: 10.1016/j.ejor.2008.09.012_bib11 article-title: On the complexity of a class of combinatorial optimization problems with uncertainty publication-title: Mathematical Programming A doi: 10.1007/PL00011424 – volume: 86 start-page: 526 issue: 3 year: 1995 ident: 10.1016/j.ejor.2008.09.012_bib33 article-title: Minimax regret solution to linear programming problems with interval objective function publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00092-Q – volume: 127 start-page: 505 issue: 3 year: 2003 ident: 10.1016/j.ejor.2008.09.012_bib12 article-title: Complexity of robust single facility location problems on networks with uncertain edge lengths publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(02)00384-0 – volume: 8 start-page: 181 issue: 3 year: 1999 ident: 10.1016/j.ejor.2008.09.012_bib60 article-title: Robust solutions and methods in decision-aid publication-title: Journal of Multicriteria Decision Analysis doi: 10.1002/(SICI)1099-1360(199905)8:3<181::AID-MCDA242>3.0.CO;2-P – volume: 100 start-page: 345 issue: 2 year: 2003 ident: 10.1016/j.ejor.2008.09.012_bib24 article-title: An improved algorithm for selecting p items with uncertain returns according to the min–max-regret criterion publication-title: Mathematical Programming A doi: 10.1007/s10107-003-0474-7 – volume: 25 start-page: 457 issue: 6 year: 1998 ident: 10.1016/j.ejor.2008.09.012_bib65 article-title: On the robust shortest path publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(97)00085-3 – volume: 52 start-page: 35 issue: 1 year: 2004 ident: 10.1016/j.ejor.2008.09.012_bib21 article-title: The price of robustness publication-title: Operations Research doi: 10.1287/opre.1030.0065 – volume: 117 start-page: 57 issue: 1 year: 1998 ident: 10.1016/j.ejor.2008.09.012_bib45 article-title: A heuristic to minimax absolute regret for linear programs with interval objective function coefficients publication-title: European Journal of Operational Research – ident: 10.1016/j.ejor.2008.09.012_bib8 – volume: 98 start-page: 49 issue: 1–3 year: 2003 ident: 10.1016/j.ejor.2008.09.012_bib20 article-title: Robust discrete optimization and network flows publication-title: Mathematical Programming B doi: 10.1007/s10107-003-0396-4 – volume: 32 start-page: 421 issue: 5 year: 2000 ident: 10.1016/j.ejor.2008.09.012_bib42 article-title: Robust scheduling of a two-machine flow shop with uncertain processing times publication-title: IIE Transactions doi: 10.1080/07408170008963918 – volume: 174 start-page: 322 issue: 1 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib32 article-title: About the applicability of mcda to some robustness problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.01.031 – ident: 10.1016/j.ejor.2008.09.012_bib35 – ident: 10.1016/j.ejor.2008.09.012_bib62 – volume: 41 start-page: 366 issue: 3 year: 2007 ident: 10.1016/j.ejor.2008.09.012_bib49 article-title: The robust traveling salesman problem with interval data publication-title: Transportation Science doi: 10.1287/trsc.1060.0181 – volume: 160 start-page: 227 issue: 1 year: 2005 ident: 10.1016/j.ejor.2008.09.012_bib19 article-title: On the complexity of minmax regret linear programming publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.07.007 – volume: 97 start-page: 177 issue: 5 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib37 article-title: An approximation algorithm for interval data minmax regret combinatorial optimization problems publication-title: Information Processing Letters doi: 10.1016/j.ipl.2005.11.001 – volume: 6 start-page: 287 issue: 2 year: 2007 ident: 10.1016/j.ejor.2008.09.012_bib48 article-title: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data publication-title: Journal of Mathematical Modelling and Algorithms doi: 10.1007/s10852-006-9044-3 – volume: 3 start-page: 315 issue: 4 year: 2005 ident: 10.1016/j.ejor.2008.09.012_bib52 article-title: The robust shortest path problem with interval data via Benders decomposition publication-title: 4OR doi: 10.1007/s10288-005-0066-x – volume: 29 start-page: 31 issue: 1 year: 2001 ident: 10.1016/j.ejor.2008.09.012_bib63 article-title: The robust spanning tree problem with interval data publication-title: Operations Research Letters doi: 10.1016/S0167-6377(01)00078-5 – volume: vol. 3341 start-page: 65 year: 2004 ident: 10.1016/j.ejor.2008.09.012_bib7 article-title: Multicriteria global minimum cuts – ident: 10.1016/j.ejor.2008.09.012_bib28 – volume: 5 start-page: 398 issue: 5 year: 1998 ident: 10.1016/j.ejor.2008.09.012_bib46 article-title: A new mixed integer formulation for the maximum regret problem publication-title: International Transaction on Operations Research – volume: 34 start-page: 175 issue: 2 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib27 article-title: On the robust assignment problem under a fixed number of cost scenarios publication-title: Operations Research Letters doi: 10.1016/j.orl.2005.04.003 – volume: 5 start-page: 247 issue: 4 year: 1997 ident: 10.1016/j.ejor.2008.09.012_bib16 article-title: Minimax regret p-center location on a network with demand uncertainty publication-title: Location Science doi: 10.1016/S0966-8349(98)00033-3 – volume: 12 start-page: 104 issue: 2 year: 2000 ident: 10.1016/j.ejor.2008.09.012_bib17 article-title: Minmax regret median location on a network underuncertainty publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.12.2.104.11897 – volume: 161 start-page: 771 issue: 3 year: 2005 ident: 10.1016/j.ejor.2008.09.012_bib51 article-title: A branch and bound algorithm for the robust spanning tree problem with interval data publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.10.008 – volume: 35 start-page: 525 issue: 4 year: 2007 ident: 10.1016/j.ejor.2008.09.012_bib39 article-title: On the existence of an fptas for minmax regret combinatorial optimization problems with interval data publication-title: Operations Research Letters doi: 10.1016/j.orl.2006.09.007 – volume: vol. 3827 start-page: 789 year: 2005 ident: 10.1016/j.ejor.2008.09.012_bib2 article-title: Min–max (regret) versions of cut problems – ident: 10.1016/j.ejor.2008.09.012_bib5 doi: 10.1109/ICIF.2005.1591918 – volume: 169 start-page: 761 issue: 3 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib15 article-title: The minmax regret permutation flow shop problem with two jobs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.073 – year: 1997 ident: 10.1016/j.ejor.2008.09.012_bib43 doi: 10.1007/978-1-4757-2620-6 – volume: 107 start-page: 337 issue: 1–2 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib22 article-title: Robust optimization of contaminant sensor placement for community water systems publication-title: Mathematical Programming B doi: 10.1007/s10107-005-0689-x – volume: 23 start-page: 141 issue: 3 year: 1998 ident: 10.1016/j.ejor.2008.09.012_bib57 article-title: A missing link in or-da: Robustness analysis publication-title: Foundations of Computing and Decision Sciences – year: 1979 ident: 10.1016/j.ejor.2008.09.012_bib31 – volume: 27 start-page: 57 issue: 2 year: 2000 ident: 10.1016/j.ejor.2008.09.012_bib10 article-title: Minmax regret solutions for minimax optimization problems with uncertainty publication-title: Operations Research Letters doi: 10.1016/S0167-6377(00)00025-0 – volume: 179 start-page: 281 issue: 2 year: 2007 ident: 10.1016/j.ejor.2008.09.012_bib4 article-title: Approximation of min–max and min–max regret versions of some combinatorial optimization problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.03.023 – volume: 2 start-page: 273 issue: 4 year: 2005 ident: 10.1016/j.ejor.2008.09.012_bib14 article-title: Computing and minimizing the relative regret in combinatorial optimization with interval data publication-title: Discrete Optimization doi: 10.1016/j.disopt.2005.07.001 – ident: 10.1016/j.ejor.2008.09.012_bib55 doi: 10.1109/SFCS.2000.892068 – volume: 32 start-page: 36 issue: 1 year: 2004 ident: 10.1016/j.ejor.2008.09.012_bib9 article-title: On the complexity of the robust spanning tree with interval data publication-title: Operations Research Letters doi: 10.1016/S0167-6377(03)00058-0 – volume: 58 start-page: 1470 issue: 11 year: 2007 ident: 10.1016/j.ejor.2008.09.012_bib41 article-title: Energy crop supply in france: A min–max regret approach publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2602284 – volume: 174 start-page: 1479 issue: 3 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib47 article-title: A Benders decomposition approach for the robust spanning tree with interval data publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.02.060 – volume: 25 start-page: 920 issue: 6 year: 1977 ident: 10.1016/j.ejor.2008.09.012_bib58 article-title: General techniques for combinatorial approximation publication-title: Operations Research doi: 10.1287/opre.25.6.920 – volume: 31 start-page: 93 issue: 2 year: 1998 ident: 10.1016/j.ejor.2008.09.012_bib23 article-title: Min–max regret robust 1-median location on a tree publication-title: Networks doi: 10.1002/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-E – volume: 5 start-page: 227 issue: 4 year: 1997 ident: 10.1016/j.ejor.2008.09.012_bib26 article-title: α-reliable p-minimax regret: A new model for strategic facility location modeling publication-title: Location Science doi: 10.1016/S0966-8349(98)00036-9 – volume: 33 start-page: 431 issue: 4 year: 2005 ident: 10.1016/j.ejor.2008.09.012_bib36 article-title: Minimizing maximal regret in single machine sequencing problem with maximum lateness criterion publication-title: Operations Research Letters doi: 10.1016/j.orl.2004.07.004 – volume: 154 start-page: 2167 issue: 15 year: 2006 ident: 10.1016/j.ejor.2008.09.012_bib44 article-title: Complexity of minimizing the total flow time with interval data and minmax regret criterion publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2005.04.015 – volume: 32 start-page: 225 issue: 3 year: 2004 ident: 10.1016/j.ejor.2008.09.012_bib53 article-title: A branch and bound algorithm for the robust shortest path problem with interval data publication-title: Operations Research Letters doi: 10.1016/j.orl.2003.08.002 – volume: 35 start-page: 17 issue: 1 year: 2007 ident: 10.1016/j.ejor.2008.09.012_bib59 article-title: The robust minimum spanning tree problem: Compact and convex uncertainty publication-title: Operations Research Letters doi: 10.1016/j.orl.2005.12.007 – volume: 33 start-page: 634 issue: 6 year: 2005 ident: 10.1016/j.ejor.2008.09.012_bib1 article-title: Complexity of the min–max and min–max regret assignment problem publication-title: Operations Research Letters doi: 10.1016/j.orl.2004.12.002 – volume: 35 start-page: 70 issue: 1 year: 1987 ident: 10.1016/j.ejor.2008.09.012_bib61 article-title: Approximation of Pareto optima in multiple-objective, shortest-path problems publication-title: Operations Research doi: 10.1287/opre.35.1.70 |
| SSID | ssj0001515 |
| Score | 2.4934711 |
| Snippet | Min–max and min–max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then,... Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then,... |
| SourceID | proquest repec pascalfrancis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 427 |
| SubjectTerms | Applied sciences Approximation Assignment problem Combinatorial optimization Complexity Exact sciences and technology Flows in networks. Combinatorial problems Knapsack problem Min-max Min-max regret Combinatorial optimization Complexity Approximation Robustness Min–max Min–max regret Operational research and scientific management Operational research. Management science Optimization algorithms Robustness Shortest path algorithms Studies |
| Title | Min–max and min–max regret versions of combinatorial optimization problems: A survey |
| URI | https://dx.doi.org/10.1016/j.ejor.2008.09.012 http://econpapers.repec.org/article/eeeejores/v_3a197_3ay_3a2009_3ai_3a2_3ap_3a427-438.htm https://www.proquest.com/docview/204194547 |
| Volume | 197 |
| WOSCitedRecordID | wos000264605900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtR1Nb9Mw1KpWhECIjwKiDCYfuFWZEifNB7dqDAGCicOYerMS52WsWpMoyarCif_AmT_HL-E5drymaBM7UMlOasVJ0_fh957fByGvUCIQIolsSy4XlgfYoRwXW5kfeIkX-2HaZmI6-RgcHYXzefR5MPjVxcKszoM8D9frqPyvoMYxBLYMnb0BuM1NcQDPEejYI9ix_yfAf0JVX3swuMt43e4OLLfGKkA1u5mslLGs1r7lqCRLFVza0AvkJEsdojnRRWdqFcVeX1Sr_mZwz6KvpVscqDo7o04oZAzPMwS2KpaNkjts7OvH30-VPfagZT25WTJO2hicsigazSXbwPiexeLSJctEagUB4oaK2TRcWLnpanRjGzzVU8kD9PLsqWQwf3F-ZYRY7MOiqLSLbLRvaxftXprtreXPOCV2_m4LLu-h63NG3JY1rIcsmEbI94ez94fzD2apl9Jgu02lX0hHZSkHwu1fcpXkc6-Ma6THTBVS6Wk6wwpKEBsCz_FDcl9rKnSmMOwRGUA-Ire7QIkRedAVBKF6fRiRuxvZLR-TOWLi7x8_Ed8ogo8uzTeFfbTDPlpktId9dBP7aId9r-mMKtx7Qr68PTw-eGfpQh6WQPm8scBhQSpYZkMQOlNwhM8cOw5t13MhEH4kfAgZZH6c4GUZJDa4HthZHKSRk7gocD4lO3mRwzNCUUNgaQbMgzT2mJ0l4GehSB2U2yPhpcmYON2fzIXOci-LrZzzq8E7JhMzp1Q5Xq69etrBjmspVUmfHFHx2nl7PUCbRzHHRTGeuWOy20Gea3qt8QaeE8mke2PypkUGMw3wg4-Amq-4GyP5YP8Nm6Q4PJzJU2wlNqQgjnTDvzbL5zd6111y55KAX5CdprqAl-SWWDVndbWnqeEPiqzjGA |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Min%E2%80%93max+and+min%E2%80%93max+regret+versions+of+combinatorial+optimization+problems%3A+A+survey&rft.jtitle=European+journal+of+operational+research&rft.au=Aissi%2C+Hassene&rft.au=Bazgan%2C+Cristina&rft.au=Vanderpooten%2C+Daniel&rft.date=2009-09-01&rft.issn=0377-2217&rft.volume=197&rft.issue=2&rft.spage=427&rft.epage=438&rft_id=info:doi/10.1016%2Fj.ejor.2008.09.012&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2008_09_012 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |