Prioritization via Stochastic Optimization

References

• Allen D, Ismail I, Kennington J, Olinick E (2003) An incremental procedure for improving path assignment in a telecommunications network. J. Heuristics 9(5):375–399.Crossref, Google Scholar
• Balinski ML (1970) Selection problem. Management Sci. Ser. A–Theory 17(3):230–231.Link, Google Scholar
• Beasley JE (2011) OR-Library. http://people.brunel.ac.uk/~mastjjb/jeb/info.html.Google Scholar
• Brown GG, Carlyle M, Salmerón J, Wood RK (2006) Defending critical infrastructure. Interfaces 36(6):530–544.Link, Google Scholar
• Carøe CC, Tind J (1998) L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Programming 83(1–3):451–464.Crossref, Google Scholar
• Cplex (2011) IBM ILOG. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/.Google Scholar
• Dean B, Goemans MX, Vondrák J (2005) Adaptivity and approximation for stochastic packing problems. Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, Vancouver, British Columbia (ACM, New York), 395–404.Google Scholar
• Dean B, Goemans MX, Vondrák J (2008) Approximating the stochastic knapsack problem: The benefit of adaptivity. Math. Oper. Res. 33(4):945–964.Link, Google Scholar
• Hochbaum DS (2009) Dynamic evolution of economically preferred facilities. Eur. J. Oper. Res. 193(3):649–659.Crossref, Google Scholar
• Israeli E, Wood RK (2002) Shortest-path network in interdiction. Networks 40(2):97–111.2Crossref, Google Scholar
• Koç A (2010) Prioritization via stochastic optimization. Ph.D. dissertation, The University of Texas at Austin, Austin.Google Scholar
• Koç A, Kalagnanam J (2012) Parallel branch-cut-price for solving stochastic unit commitment problems for the smart grid. Working paper, IBM Thomas J. Watson Research Center, Yorktown Heights, NY.Google Scholar
• Koç A, Morton DP, Popova E, Hess SM, Kee E, Richards D (2009) Prioritizing project selection. Engrg. Economist 54(4):267–297.Crossref, Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Lin G, Nagarajan C, Rajaraman R, Williamson DP (2006) A general approach for incremental approximation and hierarchical clustering. Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, (ACM, New York), 1147–1156.Crossref, Google Scholar
• Lulli G, Sen S (2004) A branch-and-price algorithm for multistage stochastic integer programming with application to stochastic batch-sizing problems. Management Sci. 50(6):786–796.Link, Google Scholar
• Mettu RR, Plaxton CG (2003) The online median problem. SIAM J. Comput. 32(3):816–832.Crossref, Google Scholar
• Mirchandani PB, Francis RL (1990) Discrete Location Theory (John Wiley & Sons, New York).Google Scholar
• Nehme MV, Morton DP (2010) Efficient nested solutions of the bipartite network interdiction. Proc. IIE Annual Conf..Google Scholar
• Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions—I. Math. Programming 14(1):265–294.Crossref, Google Scholar
• Plaxton CG (2006) Approximation algorithms for hierarchical location problems. J. Comput. Syst. Sci. 72(3):425–443.Crossref, Google Scholar
• Potts CN (1985) A Lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time. Management Sci. 31(10):1300–1311.Link, Google Scholar
• Rhys JMW (1970) Selection problem of shared fixed costs and network flows. Management Sci. Ser. A–Theory 17(3):200–207.Link, Google Scholar
• Rosen KH (2006) Discrete Mathematics and Its Applications (McGraw-Hill, New York).Google Scholar
• Savage S, Scholtes S, Zweidler D (2006) Probability management. OR/MS Today 33(1):20–28. http://www.orms-today.org/orms-2-06/probability.html.Google Scholar
• Sen S, Higle JL (2005) The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Math. Programming 104(1):1–20.Crossref, Google Scholar
• Seref O, Ahuja RK, Orlin JB (2009) Incremental network optimization: Theory and algorithms. Oper. Res. 57(3):586–594.Link, Google Scholar
• Shiina T, Birge JR (2004) Stochastic unit commitment problem. Internat. Trans. Oper. Res. 11(1):19–32.Crossref, Google Scholar
• Silva EF, Wood RK (2006) Solving a class of stochastic mixed-integer programs with branch and price. Math. Programming 108(2–3):395–418.Crossref, Google Scholar
• Witzgall CJ, Saunders PB (1988) Electronic mail and the “locator's” dilemma. Ringeisen RD, Roberts FS, eds. Applications of Discrete Mathematics (SIAM, Philadelphia), 65–84.Google Scholar