Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

  1. Eduardo Uchoa1,*,
  2. Túlio A. M. Toffolo2,
  3. Mauricio C. de Souza3,
  4. Alexandre X. Martins4,
  5. Ricardo Fukasawa5

Article first published online: 29 NOV 2011

DOI: 10.1002/net.20485

Issue

Networks

Networks

Special Issue: Special Issue on the INOC 2009 Conference, April 26–29, 2009, Pisa, Italy

Volume 59, Issue 1, pages 148–160, January 2012

Additional Information

How to Cite

Uchoa, E., Toffolo, T. A. M., de Souza, M. C., Martins, A. X. and Fukasawa, R. (2012), Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. Networks, 59: 148–160. doi: 10.1002/net.20485

Author Information

  1. 1

    Departamento de Engenharia de Produção, Universidade Federal Fluminense, Niterói, RJ, Brazil

  2. 2

    Departamento de Computação, Universidade Federal de Ouro Preto, Ouro Preto, MG, Brazil

  3. 3

    Departamento de Engenharia de Produção, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil

  4. 4

    Departamento de Ciências Exatas e Aplicadas, Universidade Federal de Ouro Preto, João Monlevade, MG, Brazil

  5. 5

    Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada

*Departamento de Engenharia de Produção, Universidade Federal Fluminense, Niterói, RJ, Brazil

Publication History

  1. Issue published online: 9 DEC 2011
  2. Article first published online: 29 NOV 2011
  3. Manuscript Accepted: JUL 2011
  4. Manuscript Received: AUG 2009

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (139K)

Options for accessing this content:

  • If you have access to this content through a society membership, please first log in to your society website.
  • If you would like institutional access to this content, please recommend the title to your librarian.
  • Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
  • You can purchase online access to this Article for a 24-hour period (price varies by title)
    • If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
    • New Users: Please register, then proceed to purchase the article.

If your institution is a registered Wiley Online Library customer, you can log in under your institution's name to see our content. This access is provided by Shibboleth or Athens.

Type your institution's name in the box below. If your institution is a Wiley customer, it will appear in the list of suggested institutions.

Please register to:

  • Save publications, articles and searches
  • Get email alerts
  • Get all the benefits mentioned below!

Register now >

Get PDF (139K)