On Two-Stage Stochastic Minimum Spanning Trees

DOI10.1007/11496915_24zbMath1119.90359OpenAlexW2107989318MaRDI QIDQ3596356

Mohit Singh, R. Ravi, Kedar Dhamdhere

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496915_24

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty, Approximation algorithm for the 2-stage stochastic matroid base problem, On the approximability of robust spanning tree problems, Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms, Unnamed Item, Totally unimodular stochastic programs, Sell or hold: A simple two-stage stochastic combinatorial optimization problem, The discrete sell or hold problem with constraints on asset values, Commitment under uncertainty: Two-stage stochastic matching problems, Hedging uncertainty: approximation algorithms for stochastic optimization problems, Two-stage combinatorial optimization problems under risk, Fuzzy α-minimum spanning tree problem: definition and solutions, On type-2 fuzzy weighted minimum spanning tree, A Unified Framework for Multistage Mixed Integer Linear Optimization