On solving the multi-period single-sourcing problem under uncertainty
DOI10.1007/s10287-005-0043-zzbMath1203.90116OpenAlexW2158815939MaRDI QIDQ926314
H. Edwin Romeijn, Laureano Fernando Escudero Bueno, Dolores Romero Morales, Antonio Alonso-Ayuso, Celeste Pizarro
Publication date: 27 May 2008
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-005-0043-z
branch-and-fix coordinationfix-and-relax coordinationsplitting variablestwin node familymixed 0--1 programsnon-anticipativity constraintstwo-stage stochastic
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)
Related Items (7)
This page was built for publication: On solving the multi-period single-sourcing problem under uncertainty