期刊
THEORETICAL COMPUTER SCIENCE
卷 408, 期 2-3, 页码 213-223出版社
ELSEVIER
DOI: 10.1016/j.tcs.2008.08.010
关键词
Stochastic combinatorial optimization; Matching algorithm
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. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据