Decomposition methods for the two-stage stochastic Steiner tree problem
type: Item
instance of: scholarly article
title: Decomposition methods for the two-stage stochastic Steiner tree problem
zbMATH Open document ID: 1401.90249
author: Markus Leitner
author: Ivana Ljubić
author: Martin Luipersbeck
author: Markus Sinnl
published in: Computational Optimization and Applications
publication date: 2018-04-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6862308
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: Benders decomposition
zbMATH Keywords: stochastic optimization
zbMATH Keywords: Steiner trees
Wikidata QID: Q57705349
describes a project that uses: SCIP-Jack
describes a project that uses: SSTPLib
describes a project that uses: SteinLib
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: s10589-017-9966-x
OpenAlex ID: W2770726825
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
cites work: L-shaped decomposition of two-stage stochastic programs with integer recourse
cites work: Integer Programming
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: Improved algorithms for the Steiner problem in networks
cites work: Reduction tests for the steiner problem in grapsh
cites work: Thinning out Steiner trees: a node-based model for uniform edge costs
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: SCIP-Jack -- a solver for STP and variants with parallelization extensions
cites work: A catalog of steiner tree formulations
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: An application-oriented guide for designing Lagrangean dual ascent algorithms
cites work: Stochastic Steiner Tree with Non-uniform Inflation
cites work: Automata, Languages and Programming
cites work: Boosted sampling
cites work: LP Rounding Approximation Algorithms for Stochastic Network Design
cites work: Validation of subgradient optimization
cites work: Q2753742
cites work: The Steiner tree problem
cites work: Solving Steiner tree problems in graphs to optimality
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Stochastic survivable network design problems: theory and practice
cites work: A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
cites work: A robust and scalable algorithm for the Steiner problem in graphs
cites work: Decomposition methods in stochastic programming
cites work: Stochastic programming with integer variables
cites work: A dual ascent approach for steiner tree problems on a directed graph
cites work: Approximation Algorithms for 2-Stage Stochastic Optimization Problems
cites work: Q3874241
cites work: Cross decomposition for mixed integer programming
cites work: Q4254875
DOI: 10.1007/S10589-017-9966-X
description: scientific article; zbMATH DE number 6862308