IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v205y2010i1p19-30.html
   My bibliography  Save this article

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation

Author

Listed:
  • Escoffier, Bruno
  • Gourvès, Laurent
  • Monnot, Jérôme
  • Spanjaard, Olivier

Abstract

This article deals with the two-stage stochastic model, which aims at explicitly taking into account uncertainty in optimization problems, that Kong and Schaefer have recently studied for the maximum weight matching problem [N. Kong, A.J. Schaefer, A factor 1/2 approximation algorithm for two-stage stochastic matching problems, European Journal of Operational Research 172(3) (2006) 740-746]. They have proved that the problem is NP-hard, and they have provided a factor approximation algorithm. We further study this problem and strengthen the hardness results, slightly improve the approximation ratio and exhibit some polynomial cases. We similarly tackle the maximum weight spanning tree problem in the two-stage setting. Finally, we make numerical experiments on randomly generated instances to compare the quality of several interesting heuristics.

Suggested Citation

  • Escoffier, Bruno & Gourvès, Laurent & Monnot, Jérôme & Spanjaard, Olivier, 2010. "Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation," European Journal of Operational Research, Elsevier, vol. 205(1), pages 19-30, August.
    • Handle: RePEc:eee:ejores:v:205:y:2010:i:1:p:19-30
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00912-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kong, Nan & Schaefer, Andrew J., 2006. "A factor approximation algorithm for two-stage stochastic matching problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 740-746, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Santanu S. Dey & Marco Molinaro & Qianyi Wang, 2018. "Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 304-332, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Santanu S. Dey & Marco Molinaro & Qianyi Wang, 2018. "Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 304-332, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:205:y:2010:i:1:p:19-30. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.