using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the expected integer recourse function, we prove that under mild conditions an optimal solution is contained in a finite set. Furthermore, we present a basic sc...
Wolsey, Integer and Combinatorial Optimization, Wiley, 1988. Numerical Algorithms Group Ltd. and Brunel University, FortMP Manual, Release 1, NAG Ltd., Oxford, UK, 1995. Google Scholar M.W.P. Savelsbergh, Preprocessing and probing techniques for mixed integer programming problems, ORSA Journal...
van Roy, T. and L.A., Wolsey. (1986). “Solving Mixed 0–1 Programs by Automatic Reformulation.”Operations Research, 35, 45–57. Google Scholar Spielberg, K. and M. Guignard. (2000). “A Sequential (quasi) hot Start Method for BB (0,1) Mixed Integer Programming.” Presented at t...