A factor 1/2 approximation algorithm for two-stage stochastic matching problems

被引：17
|
作者：
Kong, N [1 ]
Schaefer, AJ [1 ]
机构：
[1] Univ Pittsburgh, Dept Ind Engn, Pittsburgh, PA 15261 USA
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2006年 / 172卷 / 03期
基金：
美国国家科学基金会;
关键词：
stochastic programming; approximation algorithms; matching; combinatorial optimization;
D O I：
10.1016/j.ejor.2004.10.011
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
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 the approximation algorithm appears to be substantially better than its worst-case performance. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：740 / 746
页数：7
相关论文
共 50 条
  • [1] Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
    LAMSADE-CNRS, Université Paris Dauphine, Place Marechal Lattre Tassigny, F-75775 Paris Cedex 16, France
    不详
    Eur J Oper Res, 1 (19-30):
  • [2] Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
    Escoffier, Bruno
    Gourves, Laurent
    Monnot, Jerome
    Spanjaard, Olivier
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 205 (01) : 19 - 30
  • [3] Commitment under uncertainty: Two-stage stochastic matching problems
    Katriel, Irit
    Kenyon-Mathieu, Claire
    Upfal, Eli
    THEORETICAL COMPUTER SCIENCE, 2008, 408 (2-3) : 213 - 223
  • [4] Commitment under uncertainty: Two-stage stochastic matching problems
    Katriel, Irit
    Kenyon-Mathieu, Claire
    Upfal, Eli
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 171 - +
  • [5] An ADMM algorithm for two-stage stochastic programming problems
    Arpon, Sebastian
    Homem-de-Mello, Tito
    Pagnoncelli, Bernardo K.
    ANNALS OF OPERATIONS RESEARCH, 2020, 286 (1-2) : 559 - 582
  • [6] An ADMM algorithm for two-stage stochastic programming problems
    Sebastián Arpón
    Tito Homem-de-Mello
    Bernardo K. Pagnoncelli
    Annals of Operations Research, 2020, 286 : 559 - 582
  • [7] Two-Stage Stochastic Stable Matching
    Faenza, Yuri
    Foussoul, Ayoub
    He, Chengyue
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2024, 2024, 14679 : 154 - 167
  • [8] On greedy approximation algorithms for a class of two-stage stochastic assignment problems
    Karademir, Serdar
    Kong, Nan
    Prokopyev, Oleg A.
    OPTIMIZATION METHODS & SOFTWARE, 2014, 29 (01): : 42 - 67
  • [9] On two-stage stochastic knapsack problems
    Kosuch, S.
    Lisser, A.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (16) : 1827 - 1841
  • [10] Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
    Chen, Xiaojun
    Sun, Hailin
    Xu, Huifu
    MATHEMATICAL PROGRAMMING, 2019, 177 (1-2) : 255 - 289
12345