Decomposition methods for the two-stage stochastic Steiner tree problem

DOI10.1007/s10589-017-9966-xzbMath1401.90249OpenAlexW2770726825WikidataQ57705349 ScholiaQ57705349MaRDI QIDQ1744908

Martin Luipersbeck, Markus Sinnl, Markus Leitner, Ivana Ljubić

Publication date: 20 April 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-017-9966-x

zbMATH Keywords

stochastic optimizationLagrangian relaxationBenders decompositionSteiner trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Layered graph approaches for combinatorial optimization problems ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives

Uses Software

• SteinLib
• DIMACS
• SCIP-Jack
• SSTPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Partitioning procedures for solving mixed-variables programming problems
• The Steiner tree problem
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Decomposition methods in stochastic programming
• Stochastic programming with integer variables
• A robust and scalable algorithm for the Steiner problem in graphs
• Thinning out Steiner trees: a node-based model for uniform edge costs
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• Stochastic survivable network design problems: theory and practice
• A survey on Benders decomposition applied to fixed-charge network design problems
• An application-oriented guide for designing Lagrangean dual ascent algorithms
• Lagrangean relaxation. (With comments and rejoinder).
• Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
• Integer Programming
• A dual ascent approach for steiner tree problems on a directed graph
• Boosted sampling
• Stochastic Steiner Tree with Non-uniform Inflation
• Reduction tests for the steiner problem in grapsh
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Solving Steiner tree problems in graphs to optimality
• Cross decomposition for mixed integer programming
• Validation of subgradient optimization
• A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
• A catalog of steiner tree formulations
• Approximation Algorithms for 2-Stage Stochastic Optimization Problems
• LP Rounding Approximation Algorithms for Stochastic Network Design
• Automata, Languages and Programming
• Improved algorithms for the Steiner problem in networks

This page was built for publication: Decomposition methods for the two-stage stochastic Steiner tree problem