E-mail a Wiley Online Library Link

Enrique Benavent, Ángel Corberán, Guy Desaulniers, François Lessard, Isaac Plana and José M. Sanchis A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem Networks 63

Article first published online: 5 OCT 2013 | DOI: 10.1002/net.21520

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field