Laureano Fernando Escudero Bueno, María Araceli Garín Martín, María Merino Maestre, Gloria Pérez Sainz de Rozas
We present an algorithmic approach for solving large-scale two-stage stochastic mixed 0{1 problems. We can consider two classes of problems: (a) mixed 0-1 problems with 0-1 and continuos variables in the two stages, and (b) mixed 0-1 rst stage problems, where just there are continuous variables in the second stage. The approach uses the Twin Node Family concept within the algorithmic framework, the so-called Branch-and-Fix Coordination, in order to satisfy the non-anticipativity constraints for the 0-1 variables.
In order to satisfy the nonanticipativity constraints also on the rst-stage continuous variables, we need to solve two submodels of the DEM, for the given TNF integer set.
At the same time, in case (a), and in order to increase the eciency of our approach for solving large-scale instances we exploit the remaining model's structure, such that a Benders Decomposition is used to solve these linear submodels in several steps of the procedure.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados