IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v52y2006i9p1450-1455.html
   My bibliography  Save this article

Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models

Author

Listed:
  • Rafael Andrade

    (Laboratoire de Recherche en Informatique, Université Paris Sud, Bât 490 Université Paris Sud, 91405 Orsay Cedex, France)

  • Abdel Lisser

    (Laboratoire de Recherche en Informatique, Université Paris Sud, Bât 490 Université Paris Sud, 91405 Orsay Cedex, France)

  • Nelson Maculan

    (Universidade Federal do Rio de Janeiro, COPPE-Sistemas, C.P. 68511, 21945-970, Rio de Janeiro, Brazil)

  • Gérard Plateau

    (LIPN, Institut Galilée, Université Paris Nord, Avenue J.-B. Clément, 93430 Villetaneuse, France)

Abstract

In this paper we present branch-and-bound (B& B) strategies for two-stage stochastic integer network design-based models with integrality constraints in the first-stage variables. These strategies are used within L-shaped decomposition-based B& B framework. We propose a valid inequality in order to improve B& B performance. We use this inequality to implement a multirooted B& B tree. A selective use of optimality cuts is explored in the B& B approach and we also propose a subgradient-based technique for branching on 0-1 feasible solutions. Finally, we present computational results for a fixed-charge network design problem with random demands.

Suggested Citation

  • Rafael Andrade & Abdel Lisser & Nelson Maculan & Gérard Plateau, 2006. "Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models," Management Science, INFORMS, vol. 52(9), pages 1450-1455, September.
    • Handle: RePEc:inm:ormnsc:v:52:y:2006:i:9:p:1450-1455
    DOI: 10.1287/mnsc.1060.0536
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1060.0536
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.1060.0536?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. R. Andrade & A. Lisser & N. Maculan & G. Plateau, 2005. "B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty," Annals of Operations Research, Springer, vol. 140(1), pages 49-65, November.
    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. Escudero, L.F. & Garín, M.A. & Merino, M. & Pérez, G., 2010. "An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects," European Journal of Operational Research, Elsevier, vol. 204(1), pages 105-116, July.
    2. Zhen, Lu & He, Xueting & Zhuge, Dan & Wang, Shuaian, 2024. "Primal decomposition for berth planning under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    3. Escudero, Laureano F. & Landete, Mercedes & Rodríguez-Chía, Antonio M., 2011. "Stochastic set packing problem," European Journal of Operational Research, Elsevier, vol. 211(2), pages 232-240, June.

    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. Rafael Andrade & Abdel Lisser & Nelson Maculan, 2012. "Multi-service multi-facility network design under uncertainty," Annals of Operations Research, Springer, vol. 199(1), pages 157-178, October.

    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:inm:ormnsc:v:52:y:2006:i:9:p:1450-1455. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.