Two-stage stochastic matching and spanning tree problems : polynomial instances and approximation
| Year of publication: |
2010
|
|---|---|
| Authors: | Escoffier, Bruno ; Gourvès, Laurent ; Monnot, Jérôme ; Spanjaard, Olivier |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 205.2010, 1 (16.8.), p. 19-30
|
| Subject: | Graphentheorie | Graph theory | Stochastischer Prozess | Stochastic process | Matching | Mathematische Optimierung | Mathematical programming |
-
Integrating location and network restoration decisions in relief networks under uncertainty
Sanci, Ece, (2019)
-
A shortest path problem in a stochastic network with exponential travel time
Peer, S. K., (2021)
-
Shen, Siqian, (2015)
- More ...
-
Three selfish spanning tree games
Gourvès, Laurent, (2008)
-
Selfish scheduling with setup times
Gourvès, Laurent, (2009)
-
On strong equilibria in the Max Cut game
Gourvès, Laurent, (2009)
- More ...