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

A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem

Author

Listed:
  • Gouveia, Luis
  • Requejo, Cristina

Abstract

No abstract is available for this item.

Suggested Citation

  • Gouveia, Luis & Requejo, Cristina, 2001. "A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 132(3), pages 539-552, August.
    • Handle: RePEc:eee:ejores:v:132:y:2001:i:3:p:539-552
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00143-0
    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. Luis Gouveia, 1998. "Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 180-188, May.
    2. Matteo Fischetti & Paolo Toth, 1993. "An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs," INFORMS Journal on Computing, INFORMS, vol. 5(4), pages 426-434, November.
    3. Gouveia, Luis, 1996. "Multicommodity flow models for spanning trees with hop constraints," European Journal of Operational Research, Elsevier, vol. 95(1), pages 178-190, November.
    4. S. Voß, 1999. "The Steiner tree problem with hop constraints," Annals of Operations Research, Springer, vol. 86(0), pages 321-345, January.
    5. R. Kipp Martin, 1987. "Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition," Operations Research, INFORMS, vol. 35(6), pages 820-831, December.
    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. Konak, Abdullah, 2012. "Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation," European Journal of Operational Research, Elsevier, vol. 218(3), pages 829-837.
    2. Cabral, Edgar Alberto & Erkut, Erhan & Laporte, Gilbert & Patterson, Raymond A., 2007. "The network design problem with relays," European Journal of Operational Research, Elsevier, vol. 180(2), pages 834-844, July.
    3. Iago A. Carvalho & Amadeu A. Coco, 2023. "On solving bi-objective constrained minimum spanning tree problems," Journal of Global Optimization, Springer, vol. 87(1), pages 301-323, September.
    4. Akgün, Ibrahim & Tansel, Barbaros Ç., 2011. "New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints," European Journal of Operational Research, Elsevier, vol. 212(2), pages 263-276, July.
    5. Li, Xiangyong & Aneja, Y.P. & Huo, Jiazhen, 2012. "Using branch-and-price approach to solve the directed network design problem with relays," Omega, Elsevier, vol. 40(5), pages 672-679.
    6. Costa, Alysson M. & Cordeau, Jean-François & Laporte, Gilbert, 2008. "Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints," European Journal of Operational Research, Elsevier, vol. 190(1), pages 68-78, October.
    7. Gouveia, Luis & Leitner, Markus & Ljubić, Ivana, 2014. "Hop constrained Steiner trees with multiple root nodes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 100-112.

    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. Fernandes, Lucinda Matos & Gouveia, Luis, 1998. "Minimal spanning trees with a constraint on the number of leaves," European Journal of Operational Research, Elsevier, vol. 104(1), pages 250-261, January.
    2. Okan Arslan & Ola Jabali & Gilbert Laporte, 2020. "A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 120-134, January.
    3. Konak, Abdullah, 2012. "Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation," European Journal of Operational Research, Elsevier, vol. 218(3), pages 829-837.
    4. Costa, Alysson M. & Cordeau, Jean-François & Laporte, Gilbert, 2008. "Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints," European Journal of Operational Research, Elsevier, vol. 190(1), pages 68-78, October.
    5. Luis Gouveia, 1998. "Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 180-188, May.
    6. Akgün, Ibrahim & Tansel, Barbaros Ç., 2011. "New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints," European Journal of Operational Research, Elsevier, vol. 212(2), pages 263-276, July.
    7. Ivana Ljubić & Stefan Gollowitzer, 2013. "Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 256-270, May.
    8. Quentin Botton & Bernard Fortz & Luis Gouveia & Michael Poss, 2013. "Benders Decomposition for the Hop-Constrained Survivable Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 13-26, February.
    9. Selvaprabu Nadarajah & Andre A. Cire, 2020. "Network-Based Approximate Linear Programming for Discrete Optimization," Operations Research, INFORMS, vol. 68(6), pages 1767-1786, November.
    10. Scheibe, Kevin P. & Ragsdale, Cliff T., 2009. "A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 773-784, September.
    11. BOTTON, Quentin & FORTZ, Bernard & GOUVEIA, Luis & POSS, Michael, 2011. "Benders decomposition for the hop-constrained survivable network design problem," LIDAM Discussion Papers CORE 2011037, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Iago A. Carvalho & Amadeu A. Coco, 2023. "On solving bi-objective constrained minimum spanning tree problems," Journal of Global Optimization, Springer, vol. 87(1), pages 301-323, September.
    13. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    14. Cabral, Edgar Alberto & Erkut, Erhan & Laporte, Gilbert & Patterson, Raymond A., 2007. "The network design problem with relays," European Journal of Operational Research, Elsevier, vol. 180(2), pages 834-844, July.
    15. Nigam, Ashutosh & Agarwal, Yogesh K., 2014. "Optimal relay node placement in delay constrained wireless sensor network design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 220-233.
    16. Uchoa, Eduardo & Pecin, Diego & Pessoa, Artur & Poggi, Marcus & Vidal, Thibaut & Subramanian, Anand, 2017. "New benchmark instances for the Capacitated Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 845-858.
    17. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
    18. Seyed Babak Ebrahimi & Ehsan Bagheri, 2022. "A multi-objective formulation for the closed-loop plastic supply chain under uncertainty," Operational Research, Springer, vol. 22(5), pages 4725-4768, November.
    19. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    20. Fortz, Bernard & Oliveira, Olga & Requejo, Cristina, 2017. "Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 242-251.

    More about this item

    Statistics

    Access and download statistics

    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:132:y:2001:i:3:p:539-552. 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.