A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem
Version of Record online: 5 OCT 2013
Copyright © 2013 Wiley Periodicals, Inc.
Volume 63, Issue 1, pages 34–45, January 2014
How to Cite
Benavent, E., Corberán, Á., Desaulniers, G., Lessard, F., Plana, I. and Sanchis, J. M. (2014), A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. Networks, 63: 34–45. doi: 10.1002/net.21520
- Issue online: 3 DEC 2013
- Version of Record online: 5 OCT 2013
- Manuscript Accepted: APR 2013
- Manuscript Received: OCT 2011
- Ministerio de Educación y Ciencia of Spain (project MTM2009-14039-C06-02), Ministerio de Economía y Competitividad (project MTM2012-36163-C02-02) (E.B., A.C., I.D., and J.M.S.)
- Canadian Natural Sciences and Engineering Research Council. Grant Number: 157935-07
Options for accessing this content:
- If you are a society or association member and require assistance with obtaining online access instructions please contact our Journal Customer Services team.
- 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)
- New Users: Please register, then proceed to purchase the article.
Login via OpenAthens
Search for your institution's name below to login via Shibboleth.
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!