Bibliography

Alt03

F. Altenstedt. Memory consumption versus computational time in nested benders decompostion for stochastic linear programmings. Technical Report, Chalmers University of Technology, Göteborg, Sweden, 2003.

BPN01

P. Baptiste, C. Le Pape, and W. Nuijten. Constraint-Based Scheduling. Kluwer Academic Publishers, 2001.

BTGN09

A. Ben-Tal, L. El Ghaoui, and A. Nemirovski. Robust Optimization. Princeton University Press, Princeton, N.J., 2009.

Ben62

J.F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematic, 4:238–252, 1962.

BL97

J.R. Birge and F. Louveaux. Introduction to Stochastic Programming. Springer, New York, 1997.

Chi04

J.W. Chinneck. The constraint consensus method for finding approximately feasible points in nonlinear programs. INFORMS Journal on Computing, 16:255–265, 2004.

DT98

M. Dempster and R. Thompson. Parallelization and aggregation of nested benders decomposition. Annals of Operations Research, 81:163–187, 1998.

DG86

M.A. Duran and I.E. Grossmann. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 36:307–339, 1986.

FSZ10

M. Fischetti, D. Salvagni, and A. Zanette. A note on the selection of benders' cuts. Mathematical Programming B, 124:175–182, 2010.

FG94

R. Fourer and D.M. Gay. Experience with a primal presolve algorithm. In W.W. Hager, D.W. Hearn, and P.M. Pardalos, editors, Large Scale Optimization: State of the Art. Kluwer Academic Publishers, 1994.

KM05

P. Kall and J. Mayer. Stochastic Linear Programming: Models, Theory, and Computation. Springer, New York, 2005.

KT87

A.H.G. Rinnooy Kan and G.T. Timmer. Stochastic global optimization methods; part II: multi level methods. Mathematical Programming, 37:57–78, 1987.

Mar99

R.K. Martin. Large scale linear and integer optimization: A Unified Approach. Kluwer Academic Publishers, Norwell, 1999.

NW88

G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1988.

QG92

I. Quesada and I.E. Grossmann. An lp/nlp based branch and bound algorithm for bonvex minlp optimization problems. Computers and Chemical Engineering, 16:937–947, 1992.

RBTW06

F. Rossi, P. Van Beek, and editors T. Walsh. Handbook of Constraint Programming. Elsevier, 2006.

Sav94

M.W.P. Savelsbergh. Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing, 6:445–454, 1994.