Recoverable robust knapsacks: Γ-scenarios

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6701 LNCS, Issue , 2011, Pages 583-588

  Büsing, Christina ^a   Koster, Arie M C A ^b   Kutschka, Manuel ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL STUDIES; INTEGER LINEAR PROGRAMMING FORMULATION; KNAPSACK PROBLEMS; MIN-MAX OPTIMIZATION; PLANNING DATA; RECOVERY ACTIONS; ROBUST APPROACHES; WIRELESS NETWORK PLANNING;

COMPUTER SYSTEM RECOVERY; LINEAR PROGRAMMING; OPTIMIZATION; COMBINATORIAL OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 80052971856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21527-8_65     Document Type: Conference Paper

References (15)

1. Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of some combinatorial optimization problems: a survey (2007), http://hal.archives-ouvertes.fr/docs/00/15/86/52/PDF/AN7LAMSADE-1-32.pdf
2. Bellman, R.: Notes on the theory of dynamic programming IV - maximization over discrete sets. Naval Research Logistics Quarterly 3, 67-70 (1956)
3. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Mathematical Programming Ser. B 98, 49-71 (2003)
4. Bertsimas, D., Sim, M.: The Price of Robustness. Operations Research 52(1), 35-53 (2004)
5. Büsing, C.: Recoverable Robustness in Combinatorial Optimization. Ph.D. thesis, Technische Universität Berlin (to appear, 2011)
6. Büsing, C., Koster, A.M.C.A., Kutschka,M.: Recoverable robust knapsacks: the discrete scenario case. Optimization Letters, Online First (2011), http://dx.doi.org/10.1007/s11590-011-0307-1
7. Claßen, G., Koster, A.M.C.A., Schmeink, A.: Planning wireless networks with demand uncertainty using robust optimization. Optimization Online Eprint server (2011), http://www.optimization-online.org/DB-HTML/2011/03/2954. html
8. Engels, A., Reyer, M., Mathar, R.: Profit-oriented combination of multiple objectives for planning and configuration of 4G multi-hop relay networks. In: 7th International Symposium on Wireless Communication Systems (IEEE ISWCS), York, UK, pp. 330-334 (2010)
9. ILOG: CPLEX version 12.2 (2010), http://www.ibm.com
10. Karp, R.: Reducibility among combinatorial problems. Complexity of Computer Computations, pp. 85-103 (1972)
11. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
12. Klopfenstein, O., Nace, D.: Valid inequalities for a robust knapsack polyhedron - Application to the robust bandwidth packing problem. Networks (to appear, 2010)
13. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations (1990)
14. Wolsey, L.A.: Integer Programming. Wiley, Chichester (1998)
15. Yu, G.: On the max-min 0-1 knapsack problem with robust optimization applications. Operations Research 44, 407-415 (1996)