IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities

  • Gollowitzer, Stefan
  • Gouveia, Luis
  • Ljubić, Ivana
Registered author(s):

    We consider a new combinatorial optimization problem that combines network design and facility location aspects. Given a graph with two types of customers and two technologies that can be installed on the edges, the objective is to find a minimum cost subtree connecting all customers while the primary customers are served by a primary subtree that is embedded into the secondary subtree. In addition, besides fixed link installation costs, facility opening costs, associated to each node where primary and secondary subtree connect, have to be paid. The problem is called the Two Level Network Design Problem with Transition Facilities (TLNDF).

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 225 (2013)
    Issue (Month): 2 ()
    Pages: 211-222

    in new window

    Handle: RePEc:eee:ejores:v:225:y:2013:i:2:p:211-222
    DOI: 10.1016/j.ejor.2012.09.040
    Contact details of provider: Web page:

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as in new window
    1. Gouveia, Luis & Janssen, Eric, 1998. "Designing reliable tree networks with two cable technologies," European Journal of Operational Research, Elsevier, vol. 105(3), pages 552-568, March.
    2. Current, John & Pirkul, Hasan, 1991. "Theory and methodologyThe hierarchical network design problem with transshipment facilities," European Journal of Operational Research, Elsevier, vol. 51(3), pages 338-347, April.
    3. Duin, Cees & Volgenant, Anton, 1989. "Reducing the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 39(3), pages 332-344, April.
    4. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1994. "Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem," Management Science, INFORMS, vol. 40(7), pages 846-867, July.
    5. Obreque, Carlos & Donoso, Macarena & Gutiérrez, Gabriel & Marianov, Vladimir, 2010. "A branch and cut algorithm for the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 200(1), pages 28-35, January.
    6. Luis Gouveia & João Telhada, 2001. "An Augmented Arborescence Formulation for the Two-Level Network Design Problem," Annals of Operations Research, Springer, vol. 106(1), pages 47-61, September.
    7. Current, John R. & ReVelle, Charles S. & Cohon, Jared L., 1986. "The hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 27(1), pages 57-66, October.
    8. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1994. "A Dual-Based Algorithm for Multi-Level Network Design," Management Science, INFORMS, vol. 40(5), pages 567-581, May.
    9. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:225:y:2013:i:2:p:211-222. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.