Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems
Year of publication: |
2015
|
---|---|
Authors: | Shen, Siqian ; Kurt, Murat ; Wang, Jue |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 2, p. 301-316
|
Subject: | stochastic bottleneck spanning tree | chance-constrained programming | special ordered sets | bisection algorithm | NP-complete | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Engpass | Bottleneck | Stochastischer Prozess | Stochastic process |
-
A framework for solving chance-constrained linear matrix inequality programs
Karimi, Roya, (2021)
-
Peng, Chun, (2020)
-
On the egalitarian-utilitarian spectrum in stochastic capacitated resource allocation problems
Li, Linda, (2023)
- More ...
-
Structured replacement policies for a Markov-modulated shock model
Kurt, Murat, (2009)
-
Kurt, Murat, (2010)
-
Optimally maintaining a Markovian deteriorating system with limited imperfect repairs
Kurt, Murat, (2010)
- More ...