IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v197y2009i2p427-438.html

Min-max and min-max regret versions of combinatorial optimization problems: A survey

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Christina Büsing & Sebastian Goderbauer & Arie M. C. A. Koster & Manuel Kutschka, 2019. "Formulations and algorithms for the recoverable $${\varGamma }$$ Γ -robust knapsack problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(1), pages 15-45, March.
  2. Artur Alves Pessoa & Michael Poss & Ruslan Sadykov & François Vanderbeck, 2021. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty," Operations Research, INFORMS, vol. 69(3), pages 739-754, May.
  3. Feng, Xin & Dai, Yongwu, 2019. "An innovative type of forest insurance in China based on the robust approach," Forest Policy and Economics, Elsevier, vol. 104(C), pages 23-32.
  4. Marin Bougeret & Jérémy Omer & Michael Poss, 2023. "Optimization Problems in Graphs with Locational Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 578-592, May.
  5. Nadia Brauner & Gerd Finke & Yakov Shafransky, 2017. "Lawler’s minmax cost problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 31-46, July.
  6. Mehran Poursoltani & Erick Delage & Angelos Georghiou, 2024. "Technical Note—Risk-Averse Regret Minimization in Multistage Stochastic Programs," Operations Research, INFORMS, vol. 72(4), pages 1727-1738, July.
  7. Chassein, André & Goerigk, Marc & Kasperski, Adam & Zieliński, Paweł, 2018. "On recoverable and two-stage robust selection problems with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 265(2), pages 423-436.
  8. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
  9. Ayşe N. Arslan & Michael Poss & Marco Silva, 2022. "Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2212-2228, July.
  10. Karimi, Hamid & Jadid, Shahram, 2020. "Optimal energy management for multi-microgrid considering demand response programs: A stochastic multi-objective framework," Energy, Elsevier, vol. 195(C).
  11. Chlumsky-Harttmann, Fabian & Schmidt, Marie & Schöbel, Anita, 2026. "Approaches for biobjective integer linear robust optimization," European Journal of Operational Research, Elsevier, vol. 329(1), pages 198-218.
  12. Belhoul, Lyes, 2014. "Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14672 edited by Vanderpooten, Daniel.
  13. Mehran Poursoltani & Erick Delage, 2022. "Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems," Operations Research, INFORMS, vol. 70(5), pages 2906-2930, September.
  14. Marc Goerigk & Adam Kasperski & Paweł Zieliński, 2022. "Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 497-527, April.
  15. Chassein, André & Goerigk, Marc, 2018. "Variable-sized uncertainty and inverse problems in robust optimization," European Journal of Operational Research, Elsevier, vol. 264(1), pages 17-28.
  16. Choi, Byung-Cheon & Chung, Kwanghun, 2016. "Min–max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 367-375.
  17. Maciej Drwal & Jerzy Józefczyk, 2020. "Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times," Annals of Operations Research, Springer, vol. 284(1), pages 263-282, January.
  18. Alireza Amirteimoori & Simin Masrouri, 2021. "DEA-based competition strategy in the presence of undesirable products: An application to paper mills," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 5-21.
  19. Gilbert, Hugo & Spanjaard, Olivier, 2017. "A double oracle approach to minmax regret optimization problems with interval data," European Journal of Operational Research, Elsevier, vol. 262(3), pages 929-943.
  20. Joëts, Marc, 2015. "Heterogeneous beliefs, regret, and uncertainty: The role of speculation in energy price dynamics," European Journal of Operational Research, Elsevier, vol. 247(1), pages 204-215.
  21. Seyed Ashkan Hosseini Shekarabi & Reza Kiani Mavi & Flavio Romero Macau, 2025. "Supply Chain Resilience: A Critical Review of Risk Mitigation, Robust Optimisation, and Technological Solutions and Future Research Directions," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 26(3), pages 681-735, September.
  22. Amadeu A. Coco & Andréa Cynthia Santos & Thiago F. Noronha, 2022. "Robust min-max regret covering problems," Computational Optimization and Applications, Springer, vol. 83(1), pages 111-141, September.
  23. Marc Goerigk, 2014. "A note on upper bounds to the robust knapsack problem with discrete scenarios," Annals of Operations Research, Springer, vol. 223(1), pages 461-469, December.
  24. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
  25. Chassein, André B. & Goerigk, Marc, 2015. "A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 739-747.
  26. Chassein, André & Goerigk, Marc, 2017. "Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets," European Journal of Operational Research, Elsevier, vol. 258(1), pages 58-69.
  27. Ehrgott, Matthias & Ide, Jonas & Schöbel, Anita, 2014. "Minmax robustness for multi-objective optimization problems," European Journal of Operational Research, Elsevier, vol. 239(1), pages 17-31.
  28. Goerigk, Marc & Deghdak, Kaouthar & T’Kindt, Vincent, 2015. "A two-stage robustness approach to evacuation planning with buses," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 66-82.
  29. Goerigk, Marc & Hamacher, Horst W. & Kinscherff, Anika, 2018. "Ranking robustness and its application to evacuation planning," European Journal of Operational Research, Elsevier, vol. 264(3), pages 837-846.
  30. Detienne, Boris & Lefebvre, Henri & Malaguti, Enrico & Monaci, Michele, 2024. "Adjustable robust optimization with objective uncertainty," European Journal of Operational Research, Elsevier, vol. 312(1), pages 373-384.
  31. Carrizosa, Emilio & Goerigk, Marc & Schöbel, Anita, 2017. "A biobjective approach to recoverable robustness based on location planning," European Journal of Operational Research, Elsevier, vol. 261(2), pages 421-435.
  32. Marcin Siepak & Jerzy Józefczyk, 2014. "Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion," Annals of Operations Research, Springer, vol. 222(1), pages 517-533, November.
  33. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
  34. Galand, Lucie & Perny, Patrice & Spanjaard, Olivier, 2010. "Choquet-based optimisation in multiobjective shortest path and spanning tree problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 303-315, July.
  35. Fabrice Talla Nobibon & Roel Leus, 2014. "Complexity Results and Exact Algorithms for Robust Knapsack Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 533-552, May.
  36. Tan Wang & Genaro Gutierrez, 2022. "Robust Product Line Design by Protecting the Downside While Minding the Upside," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 194-217, January.
  37. Machani, Mahdi & Nourelfath, Mustapha & D’Amours, Sophie, 2015. "A scenario-based modelling approach to identify robust transformation strategies for pulp and paper companies," International Journal of Production Economics, Elsevier, vol. 168(C), pages 41-63.
  38. Jordi Pereira & Igor Averbakh, 2013. "The Robust Set Covering Problem with interval data," Annals of Operations Research, Springer, vol. 207(1), pages 217-235, August.
  39. Ram, Camelia, 2020. "Scenario presentation and scenario generation in multi-criteria assessments: An exploratory study," Technological Forecasting and Social Change, Elsevier, vol. 151(C).
  40. Wei Wu & Manuel Iori & Silvano Martello & Mutsunori Yagiura, 2022. "An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2523-2539, September.
  41. Chin Hon Tan & Chunling Luo, 2017. "Clear Preferences Under Partial Distribution Information," Decision Analysis, INFORMS, vol. 14(1), pages 65-73, March.
  42. Chassein, André & Goerigk, Marc, 2018. "Compromise solutions for robust combinatorial optimization with variable-sized uncertainty," European Journal of Operational Research, Elsevier, vol. 269(2), pages 544-555.
  43. Levorato, Mario & Figueiredo, Rosa & Frota, Yuri, 2022. "Exact solutions for the two-machine robust flow shop with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 300(1), pages 46-57.
  44. Bredström, D. & Flisberg, P. & Rönnqvist, M., 2013. "A new method for robustness in rolling horizon planning," International Journal of Production Economics, Elsevier, vol. 143(1), pages 41-52.
  45. Margarita Antoniou & Gregor Papa, 2021. "Differential Evolution with Estimation of Distribution for Worst-Case Scenario Optimization," Mathematics, MDPI, vol. 9(17), pages 1-22, September.
  46. Arash Gourtani & Huifu Xu & David Pozo & Tri-Dung Nguyen, 2016. "Robust unit commitment with $$n-1$$ n - 1 security criteria," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(3), pages 373-408, June.
  47. Cardoso, Teresa & Oliveira, Mónica Duarte & Barbosa-Póvoa, Ana & Nickel, Stefan, 2015. "An integrated approach for planning a long-term care network with uncertainty, strategic policy and equity considerations," European Journal of Operational Research, Elsevier, vol. 247(1), pages 321-334.
  48. Michał Ćwik & Jerzy Józefczyk, 2018. "Heuristic algorithms for the minmax regret flow-shop problem with interval processing times," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(1), pages 215-238, March.
  49. Raith, Andrea & Schmidt, Marie & Schöbel, Anita & Thom, Lisa, 2018. "Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty," European Journal of Operational Research, Elsevier, vol. 267(2), pages 628-642.
  50. T’kindt, Vincent & Della Croce, Federico & Agnetis, Alessandro, 2024. "Single machine adversarial bilevel scheduling problems," European Journal of Operational Research, Elsevier, vol. 315(1), pages 63-72.
  51. Luo, Chunling & Tan, Chin Hon & Liu, Xiao, 2020. "Maximum excess dominance: Identifying impractical solutions in linear problems with interval coefficients," European Journal of Operational Research, Elsevier, vol. 282(2), pages 660-676.
  52. Cohen, Izack & Postek, Krzysztof & Shtern, Shimrit, 2023. "An adaptive robust optimization model for parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 306(1), pages 83-104.
  53. Marc Goerigk & Ismaila Abderhamane Ndiaye, 2016. "Robust flows with losses and improvability in evacuation planning," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 241-270, September.
  54. Georgios P. Trachanas & Aikaterini Forouli & Nikolaos Gkonis & Haris Doukas, 2020. "Hedging uncertainty in energy efficiency strategies: a minimax regret analysis," Operational Research, Springer, vol. 20(4), pages 2229-2244, December.
  55. Jannis Kurtz, 2018. "Robust combinatorial optimization under budgeted–ellipsoidal uncertainty," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 315-337, December.
  56. Schroeder, Pascal & Kacem, Imed, 2020. "Competitive difference analysis of the cash management problem with uncertain demands," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1183-1192.
  57. Fabio Furini & Manuel Iori & Silvano Martello & Mutsunori Yagiura, 2015. "Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 392-405, May.
  58. Gita Taherkhani & Sibel A. Alumur & Mojtaba Hosseini, 2021. "Robust Stochastic Models for Profit-Maximizing Hub Location Problems," Transportation Science, INFORMS, vol. 55(6), pages 1322-1350, November.
  59. Vikneswari Someetheram & Muhammad Fadhil Marsani & Mohd Shareduwan Mohd Kasihmuddin & Nur Ezlin Zamri & Siti Syatirah Muhammad Sidik & Siti Zulaikha Mohd Jamaludin & Mohd. Asyraf Mansor, 2022. "Random Maximum 2 Satisfiability Logic in Discrete Hopfield Neural Network Incorporating Improved Election Algorithm," Mathematics, MDPI, vol. 10(24), pages 1-29, December.
  60. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.
  61. Vahid Khaligh & Majid Oloomi Buygi & Amjad Anvari-Moghaddam & Josep M. Guerrero, 2018. "A Multi-Attribute Expansion Planning Model for Integrated Gas–Electricity System," Energies, MDPI, vol. 11(10), pages 1-22, September.
  62. Chassein, André & Goerigk, Marc & Kurtz, Jannis & Poss, Michael, 2019. "Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 279(2), pages 308-319.
  63. Amadeu Coco & João Júnior & Thiago Noronha & Andréa Santos, 2014. "An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem," Journal of Global Optimization, Springer, vol. 60(2), pages 265-287, October.
  64. Kalaı¨, Rim & Lamboray, Claude & Vanderpooten, Daniel, 2012. "Lexicographic α-robustness: An alternative to min–max criteria," European Journal of Operational Research, Elsevier, vol. 220(3), pages 722-728.
  65. David Kik & Matthias G. Wichmann & Thomas S. Spengler, 2023. "Small- or Medium-Sized Enterprise Uses Operations Research to Select and Develop its Headquarters Location," Interfaces, INFORMS, vol. 53(4), pages 312-331, July.
  66. repec:wut:journl:v:2:y:2012:id:1022 is not listed on IDEAS
  67. Kasperski, Adam & Kurpisz, Adam & Zieliński, Paweł, 2012. "Approximating a two-machine flow shop scheduling under discrete scenario uncertainty," European Journal of Operational Research, Elsevier, vol. 217(1), pages 36-43.
  68. Mario Levorato & David Sotelo & Rosa Figueiredo & Yuri Frota, 2024. "Efficient solutions to the m-machine robust flow shop under budgeted uncertainty," Annals of Operations Research, Springer, vol. 338(1), pages 765-799, July.
  69. Pätzold, Julius & Schöbel, Anita, 2020. "Approximate cutting plane approaches for exact solutions to robust optimization problems," European Journal of Operational Research, Elsevier, vol. 284(1), pages 20-30.
  70. Annette M. C. Ficker & Frits C. R. Spieksma & Gerhard J. Woeginger, 2018. "Robust balanced optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(3), pages 239-266, September.
  71. Conde, Eduardo, 2012. "On a constant factor approximation for minmax regret problems using a symmetry point scenario," European Journal of Operational Research, Elsevier, vol. 219(2), pages 452-457.
  72. Bogusz Przybysławski & Adam Kasperski, 2012. "A computational study of approximation algorithms for a minmax resource allocation problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 22(2), pages 35-43.
  73. Víctor Blanco & Ricardo Gázquez & Marina Leal, 2023. "Mathematical optimization models for reallocating and sharing health equipment in pandemic situations," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 355-390, July.
  74. Nicolle, Adrien & Massol, Olivier, 2023. "Build more and regret less: Oversizing H2 and CCS pipeline systems under uncertainty," Energy Policy, Elsevier, vol. 179(C).
  75. Ana Klobučar & Robert Manger, 2020. "Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees," Mathematics, MDPI, vol. 8(2), pages 1-16, February.
  76. Haokai Xie & Pu Zhao & Xudong Ji & Qun Lin & Lianguang Liu, 2019. "Expansion Planning Method of the Industrial Park Integrated Energy System Considering Regret Aversion," Energies, MDPI, vol. 12(21), pages 1-20, October.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.