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

Solving group Steiner problems as Steiner problems

Author

Listed:
  • Duin, C. W.
  • Volgenant, A.
  • Vo[ss], S.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:154:y:2004:i:1:p:323-329
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00707-5
    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. Dror, M. & Haouari, M. & Chaouachi, J., 2000. "Generalized spanning trees," European Journal of Operational Research, Elsevier, vol. 120(3), pages 583-592, February.
    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. 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.
    2. Feess, E. & Walzl, M., 2004. "An analysis of corporte leniency programs and lessons to learn for EU and US policies," Research Memorandum 037, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. 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.
    4. Ö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.
    5. Slobodan Jelić & Domagoj Ševerdija, 2018. "Government Formation Problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 659-672, September.

    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. 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.
    4. 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.
    5. 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.
    6. Moshe Dror & Mohamed Haouari, 2000. "Generalized Steiner Problems and Other Variants," Journal of Combinatorial Optimization, Springer, vol. 4(4), pages 415-436, December.
    7. 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.
    8. P. Pop, 2007. "On the prize-collecting generalized minimum spanning tree problem," Annals of Operations Research, Springer, vol. 150(1), pages 193-204, March.
    9. Bruce Golden & S. Raghavan & Daliborka Stanojević, 2005. "Heuristic Search for the Generalized Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 290-304, August.
    10. Pop, Petrica C. & Kern, W. & Still, G., 2006. "A new relaxation method for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 170(3), pages 900-908, May.
    11. Ö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.
    12. Mehmet Berkehan Akçay & Hüseyin Akcan & Cem Evrendilek, 2018. "All Colors Shortest Path problem on trees," Journal of Heuristics, Springer, vol. 24(4), pages 617-644, August.
    13. 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.
    14. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2003. "Generalized network design problems," European Journal of Operational Research, Elsevier, vol. 148(1), pages 1-13, July.
    15. 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.
    16. F. Carrabs & R. Cerulli & R. Pentangelo & A. Raiconi, 2018. "A two-level metaheuristic for the all colors shortest path problem," Computational Optimization and Applications, Springer, vol. 71(2), pages 525-551, November.
    17. 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.

    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:154:y:2004:i:1:p:323-329. 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.