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

Upper and lower bounding strategies for the generalized minimum spanning tree problem

Author

Listed:
  • Haouari, Mohamed
  • Chaouachi, Jouhaina Siala

Abstract

No abstract is available for this item.

Suggested Citation

  • Haouari, Mohamed & Chaouachi, Jouhaina Siala, 2006. "Upper and lower bounding strategies for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 632-647, June.
    • Handle: RePEc:eee:ejores:v:171:y:2006:i:2:p:632-647
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00653-8
    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. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2001. "On generalized minimum spanning trees," European Journal of Operational Research, Elsevier, vol. 134(2), pages 457-458, October.
    2. Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
    3. Dror, M. & Haouari, M. & Chaouachi, J., 2000. "Generalized spanning trees," European Journal of Operational Research, Elsevier, vol. 120(3), pages 583-592, February.
    4. M Haouari & J S Chaouachi, 2002. "A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(7), pages 792-799, July.
    5. Duin, C. W. & Volgenant, A. & Vo[ss], S., 2004. "Solving group Steiner problems as Steiner problems," European Journal of Operational Research, Elsevier, vol. 154(1), pages 323-329, April.
    6. Kansal, Anuraag R & Torquato, Salvatore, 2001. "Globally and locally minimal weight spanning tree networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 301(1), pages 601-619.
    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. Pop, Petrică C. & Matei, Oliviu & Sabo, Cosmin & Petrovan, Adrian, 2018. "A two-level solution approach for solving the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 478-487.
    2. Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie, 0. "A rapid learning automata-based approach for generalized minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-24.
    3. Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie, 2020. "A rapid learning automata-based approach for generalized minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 636-659, October.
    4. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    5. Öncan, Temel & Cordeau, Jean-François & Laporte, Gilbert, 2008. "A tabu search heuristic for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 306-319, December.

    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. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    2. M Haouari & J Chaouachi & M Dror, 2005. "Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 382-389, April.
    3. Öncan, Temel & Cordeau, Jean-François & Laporte, Gilbert, 2008. "A tabu search heuristic for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 306-319, December.
    4. Ghosh, Diptesh, 2003. "A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem," IIMA Working Papers WP2003-07-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2003. "Generalized network design problems," European Journal of Operational Research, Elsevier, vol. 148(1), pages 1-13, July.
    6. Ghosh, Diptesh, 2003. "Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems," IIMA Working Papers WP2003-08-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    7. Pop, Petrică C. & Matei, Oliviu & Sabo, Cosmin & Petrovan, Adrian, 2018. "A two-level solution approach for solving the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 478-487.
    8. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    9. Derigs, U. & Kaiser, R., 2007. "Applying the attribute based hill climber heuristic to the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 719-732, March.
    10. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    11. Ali Amiri, 0. "Application placement in computer clustering in software as a service (SaaS) networks," Information Technology and Management, Springer, vol. 0, pages 1-13.
    12. Duin, C. W. & Volgenant, A. & Vo[ss], S., 2004. "Solving group Steiner problems as Steiner problems," European Journal of Operational Research, Elsevier, vol. 154(1), pages 323-329, April.
    13. Barbara Kulesz & Andrzej Sikora & Adam Zielonka, 2018. "Application Of Ant-Colony Algorithm To The Issue Of Improving Rectified Voltage Parameters In Electric Tram Traction," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 13(2), pages 133-144, June.
    14. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    15. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2016. "Generalized minimum spanning tree games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 167-188, May.
    16. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    17. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2001. "On generalized minimum spanning trees," European Journal of Operational Research, Elsevier, vol. 134(2), pages 457-458, October.
    18. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.
    19. Kansal, Anuraag R & Torquato, Salvatore, 2001. "Globally and locally minimal weight spanning tree networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 301(1), pages 601-619.
    20. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.

    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:171:y:2006:i:2:p:632-647. 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.