On Two-Stage Stochastic Minimum Spanning Trees

DOI10.1007/11496915_24zbMATH Open1119.90359OpenAlexW2107989318MaRDI QIDQ3596356FDOQ3596356

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

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

Mathematics Subject Classification ID

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

Cited In (22)

• On the random 2-stage minimum spanning tree
• Title not available (Why is that?)
• Two-stage combinatorial optimization problems under risk
• Sell or hold: A simple two-stage stochastic combinatorial optimization problem
• Stochastic minimum spanning trees in Euclidean spaces
• Automata, Languages and Programming
• The discrete sell or hold problem with constraints on asset values
• On the approximability of robust spanning tree problems
• Stochastic minimum spanning trees and related problems
• Fuzzy \(\alpha\)-minimum spanning tree problem: definition and solutions
• A unified framework for multistage mixed integer linear optimization
• On the random 2-stage minimum spanning tree
• 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
• Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
• Commitment under uncertainty: Two-stage stochastic matching problems
• 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
• Stochastic Steiner Tree with Non-uniform Inflation

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)