Solving a Class of Stochastic Minimization Problems

DOI10.1287/OPRE.42.3.428MaRDI QIDQ4305747zbMATH OpenOpenAlexFDO

Authors Michael Page Bailey

Publication date 15 September 1994

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.42.3.428

zbMATH Keywords

communicationsdiscrete minimizationabsorbing state in a Markov chainminimum weight solutionrandom element weights

Mathematics Subject Classification ID

Stochastic programming (90C15) Communication networks in operations research (90B18)

Recommendations

• On a discrete optimization problem
• The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions
• Minimax analysis of stochastic problems
• Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks

Cited in

(6)

• Algorithms for the solution of stochastic dynamic minimax problems
• Minimum spanning trees in networks with varying edge weights
• scientific article; zbMATH DE number 6747345 (Why is no real title available?)
• Stochastic methods for solving minimax problems
• scientific article; zbMATH DE number 1555182 (Why is no real title available?)
• Methods for solving stochastic bilinear fractional max-min problems

This page was built for publication: Solving a Class of Stochastic Minimization Problems

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