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

zbMATH Keywords

branch-and-fix coordinationfix-and-relax coordinationsplitting variablestwin node familymixed 0--1 programsnon-anticipativity constraintstwo-stage stochastic

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)

Related Items (7)

On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming ⋮ An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ Using and extending fix-and-relax to solve maritime inventory routing problems ⋮ On a stochastic sequencing and scheduling problem ⋮ Supplier selection problem for multiple projects with uncertain demand and project life cycles ⋮ On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty

This page was built for publication: On solving the multi-period single-sourcing problem under uncertainty