Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290): Difference between revisions

@@ Property / author @@
+Bruno Escoffier
@@ Property / author: Bruno Escoffier / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2009.12.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2086379185
@@ Property / OpenAlex ID: W2086379185 / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Stochastic Programming
@@ Property / cites work: Introduction to Stochastic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the random 2-stage minimum spanning tree
@@ Property / cites work: On the random 2-stage minimum spanning tree / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3960718
@@ Property / cites work: Q3960718 / rank @@
+Normal rank
@@ Property / cites work @@
+Boosted sampling
@@ Property / cites work: Boosted sampling / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q5501328
@@ Property / cites work: Q5501328 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4309474
@@ Property / cites work: Q4309474 / rank @@
+Normal rank
@@ Property / cites work @@
+Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
+Normal rank
@@ Property / cites work @@
+A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Hedging uncertainty: approximation algorithms for stochastic optimization problems
+Normal rank