Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
نویسندگان
چکیده
منابع مشابه
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
This article deals with the two stage stochastic model, which aims at explicitely taking into account uncertainty in optimization problems, that Kong and Schaefer have recently studied for the maximum weight matching problem [10]. They have proved that the problem is NP-hard, and they have provided a factor 12 approximation algorithm. We further study this problem and strengthen the hardness re...
متن کاملPolynomial Approximation for Two Stage Stochastic Programming with Separable Objective
In this paper, the authors solve the two stage stochastic programming with separable objective by obtaining convex polynomial approximations to the convex objective function with an arbitrary accuracy. Our proposed method will be valid for realistic applications, for example, the convex objective can be either non-differentiable or only accessible by Monte Carlo simulations. The resulting polyn...
متن کاملA factor 1/2 approximation algorithm for two-stage stochastic matching problems
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its correctness. We also provide a tight example to show the bound given by the algorithm is exactly 1 2 . Computational results on some two-stage stochastic bipartite matching instances indicate that the performance of th...
متن کاملSolving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage when only probabilistic information on the set of terminals and the future edge costs is known. In the second stage, one of the given scenarios is realized and additional edges are purchased to interconnect the set of (now known)...
متن کاملChance-Constrained Programming Models and Approximation Algorithms for General Stochastic Bottleneck Spanning Tree Problems
This paper considers a balance-constrained stochastic bottleneck spanning tree problem (BCSBSTP) in which edge weights are independently distributed but may follow arbitrary random distributions. The problem minimizes a scalar and seeks a spanning tree, of which the maximum edge weight is bounded by the scalar for a given certain probability, and meanwhile the minimum edge weight is lower bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2010
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2009.12.004