IDEAS home Printed from
   My bibliography  Save this article

Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem


  • de Souza, Mauricio C.
  • Martins, Pedro


We develop ideas to enhance the performance of the variable neighborhood search (VNS) by guiding the search in the shaking phase, and by employing the Skewed strategy. For this purpose, Second Order algorithms and Skewed functions expressing structural differences are embedded in an efficient VNS proposed in the literature for the degree constrained minimum spanning tree problem. Given an undirected graph with weights associated with its edges, the degree constrained minimum spanning tree problem consists in finding a minimum spanning tree of the given graph, subject to constraints on node degrees. Computational experiments are conducted on the largest and hardest benchmark instances found in the literature to date. We report results showing that the VNS with the proposed strategies improved the best known solutions for all the hardest benchmark instances. Moreover, these new best solutions significantly reduced the gaps with respect to tight lower bounds reported in the literature.

Suggested Citation

  • de Souza, Mauricio C. & Martins, Pedro, 2008. "Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 677-690, December.
  • Handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:677-690

    Download full text from publisher

    File URL:
    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

    1. Brimberg, J. & Urosevic, D. & Mladenovic, N., 2006. "Variable neighborhood search for the vertex weighted k-cardinality tree problem," European Journal of Operational Research, Elsevier, vol. 171(1), pages 74-84, May.
    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. Cerrone, C. & Cerulli, R. & Raiconi, A., 2014. "Relations, models and a memetic approach for three degree-dependent spanning tree problems," European Journal of Operational Research, Elsevier, vol. 232(3), pages 442-453.

    More about this item


    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:eee:ejores:v:191:y:2008:i:3:p:677-690. 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: (Dana Niculescu). 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.

    If CitEc recognized a 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.

    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.