Name
Abstract | ||
|---|---|---|
We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version, the uncertainty is in the second stage costs of the edges, and in the other version, the uncertainty is in the set of vertices that needs to be matched. We prove lower bounds, and analyze efficient strategies for both cases. These problems model real-life stochastic integral planning problems, such as commodity trading, reservation systems and scheduling under uncertainty. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.tcs.2008.08.010 | International Congress of Mathematicans |
Keywords | Field | DocType |
Stochastic combinatorial optimization,Matching algorithm | Discrete mathematics,Probabilistic-based design optimization,Combinatorics,Mathematical optimization,Stochastic optimization,Steiner tree problem,Scheduling (computing),Computer science,Robust optimization,Bipartite graph,3-dimensional matching,Stochastic programming | Journal |
Volume | Issue | ISSN |
408 | 2 | Theoretical Computer Science |
ISBN | Citations | PageRank |
3-540-73419-8 | 23 | 1.16 |
References | Authors | |
22 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Irit Katriel | 1 | 176 | 13.72 |
| Claire Kenyon-Mathieu | 2 | 236 | 12.85 |
| Eli Upfal | 3 | 4310 | 743.13 |