Robust combinatorial optimization with variable cost uncertainty

European Journal of Operational Research

Volumn 237, Issue 3, 2014, Pages 836-845

  Poss, Michael ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Budgeted uncertainty; Combinatorial optimization; Dynamic programming; Price of robustness; Robust optimization

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; GRAPH THEORY; ROBUSTNESS (CONTROL SYSTEMS);

BUDGETED UNCERTAINTY; COMBINATORIAL ALGORITHM; DETERMINISTIC PROBLEMS; DYNAMIC PROGRAMMING ALGORITHM; OPTIMIZATION PROBLEMS; ROBUST OPTIMIZATION; SHORTEST PATH PROBLEM; SURVIVABLE NETWORK DESIGN;

BUDGET CONTROL;

EID: 84899924780     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.02.060     Document Type: Article

References (23)

1. E. Álvarez-Miranda, I. Ljubic, and P. Toth A note on the bertsimas & sim algorithm for robust combinatorial optimization problems 4OR 11 4 2013 349 360
2. C. Bentz, M.-C. Costa, N. Derhy, and F. Roupin Cardinality constrained and multicriteria (multi)cut problems Journal of Discrete Algorithms 7 1 2009 102 111
3. D. Bertsimas, and M. Sim Robust discrete optimization and network flows Mathematical Programming 98 2003 49 71
4. D. Bertsimas, and M. Sim The price of robustness Operations Research 52 2004 35 53
5. Q. Botton, B. Fortz, L. Gouveia, and M. Poss Benders decomposition for the hop-constrained survivable network design problem INFORMS Journal on Computing 25 1 2013 13 26
6. P. Brucker, and S. Knust Complex scheduling 2006 Springer
7. Büsing, C.; D'Andreagiovanni, F. (2012). New results about multi-band uncertainty in robust optimization. In SEA (pp. 63-74).
8. G. Cornuejols, and R. Tutuncu Optimization methods in finance Vol. 13 2006 Cambridge University Press
9. CPLEX (2013). IBM-ILOG cplex optimizer.
10. E. Erdogan, and G. Iyengar Ambiguous chance constrained problems and robust optimization Mathematical Programming 107 2006 37 61
11. M. Held, and R.M. Karp A dynamic programming approach to sequencing problems Journal of the Society for Industrial and Applied Mathematics 10 1 1962 196 210
12. O. Klopfenstein, and D. Nace A robust approach to the chance-constrained knapsack problem Operations Research Letters 36 5 2008 628 632
13. A.M.C.A. Koster, M. Kutschka, and C. Raack Robust network design: Formulations, valid inequalities, and computations Networks 2 61 2013 128 149
14. C. Lee, K. Lee, K. Park, and S. Park Technical note - Branch-And-price-And-cut approach to the robust network design problem without flow bifurcations Operations Research 60 3 2012 604 610
15. A. Mahjoub, L. Simonetti, and E. Uchoa Hop-level flow formulation for the survivable network design with hop constraints problem Networks 61 2 2013 171 179
16. Mattia, S. (2012). Robust optimization with multiple intervals. Tech. Rep. 12-07, IASI-CNR.
17. M. Monaci, and U. Pferschy On the robust knapsack problem SIAM Journal on Optimization 23 4 2013 1956 1982
18. M. Monaci, U. Pferschy, and P. Serafini Exact solution of the robust knapsack problem Computers and OR 40 11 2013 2625 2631
19. M. Poss Robust combinatorial optimization with variable budgeted uncertainty 4OR 11 1 2013 75 92
20. G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path problem Networks 51 3 2008 155 170
21. M. Sniedovich Dynamic programming foundations and principles 2nd ed. 2011 CRC
22. J. Zácková On minimax solution of stochastic linear programming problems Casopis pro Pestování Matematiky 91 1966 423 430
23. F.B. Zhan, and C.E. Noon Shortest path algorithms: An evaluation using real road networks Transportation Science 32 1 1998 65 73