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, 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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Katriel, I., Kenyon-Mathieu, C., & Upfal, E. (2007). Commitment under uncertainty: Two-stage stochastic matching problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 171–182). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
