A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems (Q2488899): Difference between revisions

@@ 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.2004.10.011
+Normal rank
@@ Property / OpenAlex ID @@
+W1966191083
@@ Property / OpenAlex ID: W1966191083 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+Introduction to Stochastic Programming
@@ Property / cites work: Introduction to Stochastic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4371290
@@ Property / cites work: Q4371290 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and relaxations for a service provision problem on a telecommunication network
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q4309474
@@ Property / cites work: Q4309474 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2488899