On Two-Stage Stochastic Minimum Spanning Trees

DOI10.1007/11496915_24MaRDI QIDQ3596356zbMATH OpenOpenAlexFDO

Authors Kedar Dhamdhere, R. Ravi, Mohit Singh

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) Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15)

Recommendations

• On the random 2-stage minimum spanning tree
• On the approximability of robust spanning tree problems
• On the random 2-stage minimum spanning tree
• Stochastic minimum spanning trees and related problems
• Stochastic Steiner Tree with Non-uniform Inflation

Cited in

(22)

• Stochastic Steiner Tree with Non-uniform Inflation
• On the random 2-stage minimum spanning tree
• scientific article; zbMATH DE number 7650071 (Why is no real title available?)
• Two-stage combinatorial optimization problems under risk
• Sell or hold: A simple two-stage stochastic combinatorial optimization problem
• The discrete sell or hold problem with constraints on asset values
• Stochastic minimum spanning trees in Euclidean spaces
• Automata, Languages and Programming
• On the approximability of robust spanning tree problems
• Stochastic minimum spanning trees and related problems
• Fuzzy -minimum spanning tree problem: definition and solutions
• On the random 2-stage minimum spanning tree
• A unified framework for multistage mixed integer linear optimization
• Totally unimodular stochastic programs
• On type-2 fuzzy weighted minimum spanning tree
• Interval elimination method for stochastic spanning tree problem
• Approximation algorithm for the 2-stage stochastic matroid base problem
• Commitment under uncertainty: Two-stage stochastic matching problems
• Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty

This page was built for publication: On Two-Stage Stochastic Minimum Spanning Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596356)