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 | Engpass | Bottleneck | Algorithmus | Algorithm | Graphentheorie | Graph theory | Stochastischer Prozess | Stochastic process |
-
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
Pinto, Leizer Limo, (2010)
-
Pinto, Leizer Lima, (2010)
-
Efficient heuristic algorithm for identifying critical nodes in planar networks
Purevsuren, Dalaijargal, (2019)
- More ...
-
Optimally maintaining a Markovian deteriorating system with limited imperfect repairs
Kurt, Murat, (2010)
-
Valuing Prearranged Paired Kidney Exchanges: A Stochastic Game Approach
Unver, M. Utku Ünver, (2011)
-
Structured replacement policies for a Markov-modulated shock model
Kurt, Murat, (2009)
- More ...