Ortuño Sánchez, María TeresaAlonso Ayuso, AntonioEscudero Bueno, Laureano Fernando2023-06-202023-06-202003-12-16Alonso-Ayuso, Antonio, Laureano F. Escudero, y M. Teresa Ortuño. «BFC, A Branch-and-Fix Coordination Algorithmic Framework for Solving Some Types of Stochastic Pure and Mixed 0–1 Programs». European Journal of Operational Research 151, n.o 3 (diciembre de 2003): 503-19. https://doi.org/10.1016/S0377-2217(02)00628-8.0377-221710.1016/S0377-2217(02)00628-8https://hdl.handle.net/20.500.14352/50244We present a framework for solving some types of 0-1 multi-stage scheduling/planning problems under uncertainty in the objective function coefficients and the right-hand-side. A scenario analysis scheme with full recourse is used. The solution offered for each scenario group at each stage takes into account all scenarios but without subordinating to any of them. The constraints are modelled by a splitting variables representation via scenarios. So, a 0-1 model for each scenario is considered plus the non-anticipativity constraints that equate the 0-1 variables from the same group of scenarios in each stage. The mathematical representation of the model is very amenable for the proposed framework to deal with the 0-1 character of the variables. A branch-and-fix coordination approach is introduced for coordinating the selection of the branching nodes and branching variables in the scenario subproblems to be jointly optimized. Some computational experience is reported for different types of problems.engBFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programsjournal articlehttps//doi.org/10.1016/S0377-2217(02)00628-8http://www.sciencedirect.com/science/article/pii/S0377221702006288restricted access519.8Stochastic programmingMultistage scenario treeMixed 0-1 programsSplitting variables representationTwin node familiesFlow management problemInteger recourseDecompositionInvestigación operativa (Matemáticas)1207 Investigación Operativa