IDEAS home Printed from
   My bibliography  Save this article

Lagrangean bounds for the optimum communication spanning tree problem


  • Ivan Contreras


  • Elena Fernández


  • Alfredo Marín



No abstract is available for this item.

Suggested Citation

  • Ivan Contreras & Elena Fernández & Alfredo Marín, 2010. "Lagrangean bounds for the optimum communication spanning tree problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 140-157, July.
  • Handle: RePEc:spr:topjnl:v:18:y:2010:i:1:p:140-157 DOI: 10.1007/s11750-009-0112-5

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

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

    References listed on IDEAS

    1. D. Fernández & E. Pilotta & G. Torres, 2013. "An inexact restoration strategy for the globalization of the sSQP method," Computational Optimization and Applications, Springer, pages 595-617.
    2. Philip Gill & Daniel Robinson, 2012. "A primal-dual augmented Lagrangian," Computational Optimization and Applications, Springer, pages 1-25.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. 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.
    2. Marín, Alfredo, 2011. "The discrete facility location problem with balanced allocation of customers," European Journal of Operational Research, Elsevier, vol. 210(1), pages 27-38, April.
    3. Wälde, Klaus & Moors, Agnes, 2016. "Current Emotion Research in Economics," IZA Discussion Papers 10261, Institute for the Study of Labor (IZA).

    More about this item


    Network design; Lagrangean relaxation; Heuristics; 90B10; 90B18; 90C10;

    JEL classification:


    Access and download statistics


    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:spr:topjnl:v:18:y:2010:i:1:p:140-157. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    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.

    We have no references for this item. You can help adding them by using 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.