Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

References

• Aissi H, Bazgan C, Vanderpooten D (2009) Minmax and minmax regret versions of combinatorial optimization problems: A survey. Eur. J. Oper. Res. 197:427–438.Crossref, Google Scholar
• Aissi H, Bazgan C, Vanderpooten D (2010) General approximation schemes for minmax (regret) versions of some (pseudo-)polynomial problems. Discrete Optim. 7:136–148.Crossref, Google Scholar
• Averbakh I (2001) On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program. A 90:263–272.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (2000) Robust solution of linear programming problems contaminated with uncertain data. Math. Program. 88:411–424.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed integer variables programming problems. Numerische Mathematik 4:238–252.Crossref, Google Scholar
• Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Program. B 98:49–71.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52:35–53.Link, Google Scholar
• Birge J, Louveaux F (2011) Introduction to Stochastic Programming, 2nd ed., Springer Series in Operations Research and Financial Engineering (Springer, Berlin).Crossref, Google Scholar
• Candia-Véjar A, Álvarez-Miranda E, Maculan N (2011) Min–max regret combinatorial optimization problems: An algorithmic perspective. RAIRO—Oper. Res. 45:101–129.Crossref, Google Scholar
• Deineko VG, Woeginger GJ (2010) Pinpointing the complexity of the interval min–max regret knapsack problem. Discrete Optim. 7:191–196.Crossref, Google Scholar
• Dodonova A, Khoroshilov Y (2005) Applications of regret theory to asset pricing. Technical report, University of Ottawa, http://dx.doi.org/10.2139/ssrn.301383.Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco).Google Scholar
• Kasperski A (2008) Discrete Optimization with Interval Data (Springer, Berlin).Google Scholar
• Kazakci AO, Rozakis S, Vanderpooten D (2007) Energy crop supply in France: A minmax regret approach. J. Oper. Res. Soc. 58:1470–1479.Crossref, Google Scholar
• Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems (Springer, Berlin).Crossref, Google Scholar
• Kouvelis P, Yu G (1997) Robust Discrete Optimization and Its Applications (Kluwer AP, Dordrecht, The Netherlands).Crossref, Google Scholar
• Martello S, Toth P (1990) Knapsack Problems: Algorithms and Computer Implementations (John Wiley & Sons, Chichester, UK).Google Scholar
• Martello S, Pisinger D, Toth P (1999) Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Sci. 45:414–424.Link, Google Scholar
• Michenaud S, Solnik B (2008) Applying regret theory to investment choices: Currency hedging decisions. J. Internat. Money Finance 27:677–694.Crossref, Google Scholar
• Montemanni R, Gambardella LM (2005) The robust shortest path problem with interval data via Benders decomposition. 4OR: Quart. J. Oper. Res. 3:315–328.Crossref, Google Scholar
• Montemanni R, Barta J, Mastrolilli M, Gambardella LM (2007) The robust traveling salesman problem with interval data. Transportation Sci. 41:366–381.Link, Google Scholar
• Papadimitriou CH (1994) Computational Complexity (Addison-Wesley, Reading, MA).Google Scholar
• Pereira J, Averbakh I (2011) Exact and heuristic algorithms for the interval data robust assignment problem. Comput. Oper. Res. 38:1153–1163.Crossref, Google Scholar
• Pereira J, Averbakh I (2013) The robust set covering problem with interval data. Ann. Oper. Res. 207:217–235.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory. MOS-SIAM Series on Optimization (SIAM, Philadelphia, PA).Crossref, Google Scholar
• Yaman H, Karaşan OE, Pinar MC (2001) The robust spanning tree problem with interval data. Oper. Res. Lett. 29:31–40.Crossref, Google Scholar
• Yu G (1996) On the max-min 0-1 knpasack problem with robust optimization applications. Oper. Res. 44:407–415.Link, Google Scholar