Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models

DOI10.1287/mnsc.1060.0536zbMath1232.90312OpenAlexW2147896682MaRDI QIDQ3115997

Gérard Plateau, Rafael Andrade, Abdel Lisser, Nelson F. Maculan

Publication date: 21 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.1060.0536

zbMATH Keywords

stochastic integer programming

Mathematics Subject Classification ID

Integer programming (90C10) 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 ⋮ Robust Network Design with Uncertain Outsourcing Cost ⋮ An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects ⋮ Structuring Bilateral Energy Contract Portfolios in Competitive Markets ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ Multi-service multi-facility network design under uncertainty ⋮ Stochastic set packing problem

This page was built for publication: Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models