Skip to content

Opening book details…

About this Computer Science article

New facets and an enhanced branch-and-cut for the min–max K-vehicles windy rural postman problem by Enrique Benavent; Angel Corberán; Isaac Plana; José M. Sanchis is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Enrique Benavent; Angel Corberán; Isaac Plana; José M. Sanchis
Publisher
John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0028-3045)
Published
2011
Language
EN
Field
Computer Science (Physical Sciences)

More by Enrique Benavent; Angel Corberán; Isaac Plana; José M. Sanchis

Browse all works by Enrique Benavent; Angel Corberán; Isaac Plana; José M. Sanchis