Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
Article first published online: 29 NOV 2011
Copyright © 2011 Wiley Periodicals, Inc.
Special Issue: Special Issue on the INOC 2009 Conference, April 26–29, 2009, Pisa, Italy
Volume 59, Issue 1, pages 148–160, January 2012
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
- Issue published online: 9 DEC 2011
- Article first published online: 29 NOV 2011
- Manuscript Accepted: JUL 2011
- Manuscript Received: AUG 2009
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.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!