IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v197y2009i2p427-438.html
   My bibliography  Save this article

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

Author

Listed:
  • Aissi, Hassene
  • Bazgan, Cristina
  • Vanderpooten, Daniel

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.

Suggested Citation

  • Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
    • Handle: RePEc:eee:ejores:v:197:y:2009:i:2:p:427-438
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00762-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. A O Kazakçi & S Rozakis & D Vanderpooten, 2007. "Energy crop supply in France: a min-max regret approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(11), pages 1470-1479, November.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. Thomas Erlebach & Hans Kellerer & Ulrich Pferschy, 2002. "Approximating Multiobjective Knapsack Problems," Management Science, INFORMS, vol. 48(12), pages 1603-1612, December.
    4. Averbakh, Igor & Lebedev, Vasilij, 2005. "On the complexity of minmax regret linear programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 227-231, January.
    5. Montemanni, R. & Gambardella, L. M., 2005. "A branch and bound algorithm for the robust spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 161(3), pages 771-779, March.
    6. Hites, R. & De Smet, Y. & Risse, N. & Salazar-Neumann, M. & Vincke, P., 2006. "About the applicability of MCDA to some robustness problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 322-332, October.
    7. Montemanni, Roberto, 2006. "A Benders decomposition approach for the robust spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1479-1490, November.
    8. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    9. Gang Yu, 1996. "On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications," Operations Research, INFORMS, vol. 44(2), pages 407-415, April.
    10. Richard L. Daniels & Panagiotis Kouvelis, 1995. "Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production," Management Science, INFORMS, vol. 41(2), pages 363-376, February.
    11. Arthur Warburton, 1987. "Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems," Operations Research, INFORMS, vol. 35(1), pages 70-79, February.
    12. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2007. "Approximation of min-max and min-max regret versions of some combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 179(2), pages 281-290, June.
    13. Sartaj Sahni, 1977. "General Techniques for Combinatorial Approximation," Operations Research, INFORMS, vol. 25(6), pages 920-936, December.
    14. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    15. R. Montemanni & J. Barta & M. Mastrolilli & L. M. Gambardella, 2007. "The Robust Traveling Salesman Problem with Interval Data," Transportation Science, INFORMS, vol. 41(3), pages 366-381, August.
    16. Inuiguchi, Masahiro & Sakawa, Masatoshi, 1995. "Minimax regret solution to linear programming problems with an interval objective function," European Journal of Operational Research, Elsevier, vol. 86(3), pages 526-536, November.
    17. Averbakh, Igor, 2006. "The minmax regret permutation flow-shop problem with two jobs," European Journal of Operational Research, Elsevier, vol. 169(3), pages 761-766, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Nikulin, Yury, 2006. "Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 606, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Roy, Bernard, 2010. "Robustness in operational research and decision aiding: A multi-faceted issue," European Journal of Operational Research, Elsevier, vol. 200(3), pages 629-638, February.
    4. 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.
    5. Lin, Jun & Ng, Tsan Sheng, 2011. "Robust multi-market newsvendor models with interval demand data," European Journal of Operational Research, Elsevier, vol. 212(2), pages 361-373, July.
    6. Vahid Nazari-Ghanbarloo & Ali Ghodratnama, 2021. "Optimizing a robust tri-objective multi-period reliable supply chain network considering queuing system and operational and disruption risks," Operational Research, Springer, vol. 21(3), pages 1963-2020, September.
    7. 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.
    8. Roya Soltani & Seyed J Sadjadi, 2014. "Reliability optimization through robust redundancy allocation models with choice of component type under fuzziness," Journal of Risk and Reliability, , vol. 228(5), pages 449-459, October.
    9. 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.
    10. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    11. 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.
    12. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," 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. 28(1), pages 143-166, March.
    13. Mavrotas, George & Figueira, José Rui & Siskos, Eleftherios, 2015. "Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection," Omega, Elsevier, vol. 52(C), pages 142-155.
    14. Tao Yao & Supreet Mandala & Byung Chung, 2009. "Evacuation Transportation Planning Under Uncertainty: A Robust Optimization Approach," Networks and Spatial Economics, Springer, vol. 9(2), pages 171-189, June.
    15. Nikulin, Yury, 2005. "Simulated annealing algorithm for the robust spanning tree problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 591, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Cleber D. Rocco & Reinaldo Morabito, 2016. "Robust optimisation approach applied to the analysis of production / logistics and crop planning in the tomato processing industry," International Journal of Production Research, Taylor & Francis Journals, vol. 54(19), pages 5842-5861, October.
    17. Klamroth, Kathrin & Köbis, Elisabeth & Schöbel, Anita & Tammer, Christiane, 2017. "A unified approach to uncertain optimization," European Journal of Operational Research, Elsevier, vol. 260(2), pages 403-420.
    18. Mausser, Helmut E. & Laguna, Manuel, 1999. "A heuristic to minimax absolute regret for linear programs with interval objective function coefficients," European Journal of Operational Research, Elsevier, vol. 117(1), pages 157-174, August.
    19. Henao, César Augusto & Ferrer, Juan Carlos & Muñoz, Juan Carlos & Vera, Jorge, 2016. "Multiskilling with closed chains in a service industry: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 179(C), pages 166-178.
    20. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:197:y:2009:i:2:p:427-438. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.