Advertisement
Published in:
2012 | OriginalPaper | Chapter
On solving strong multistage nonsymmetric stochastic mixed 0-1 problems
Authors : Laureano F. Escudero, M. Araceli Garín, María Merino, Gloria Pérez
Published in: Operations Research Proceedings 2011
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this note we present the basic ideas of a parallelizable Branch-and- Fix Coordination algorithm for solving medium and large-scale multistage mixed 0-1 optimization problems under uncertainty, where this one is represented by nonsymmetric scenario trees. An assignment of the constraint matrix blocks into independent scenario cluster MIP submodels is performed by a named cluster splitting variable - compact representation (explicit non anticipativity constraints between the cluster submodels until break stage
t*
). Some computational experience using CPLEX within COIN-OR is reported while solving a large-scale real-life problem.