Formulations and algorithms for the recoverable $${\varGamma }$$ Γ -robust knapsack problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s13675-018-0107-9
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
- Eduardo Álvarez-Miranda & Ivana Ljubić & S. Raghavan & Paolo Toth, 2015. "The Recoverable Robust Two-Level Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 1-19, February.
- 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.
- Kaparis, Konstantinos & Letchford, Adam N., 2008. "Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 91-103, April.
- Richard Bellman, 1956. "Notes on the theory of dynamic programming IV ‐ Maximization over discrete sets," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 67-70, March.
- 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.
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.- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- Roos, Ernst & den Hertog, Dick, 2019. "Reducing conservatism in robust optimization," Other publications TiSEM ad0238cd-de7a-4366-b487-b, Tilburg University, School of Economics and Management.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
More about this item
Keywords
Integer programming under uncertainty; Budget uncertainty; $${varGamma }$$ Γ -Robustness; Recoverable robustness; Knapsack;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:eurjco:v:7:y:2019:i:1:d:10.1007_s13675-018-0107-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.