Skip to content

Opening book details…

About this Computer Science article

A Branch-price-and-cut Algorithm for the Min-max K -Vehicle Windy Rural Postman Problem by Benavent, Enrique; Corberán, Ángel; Desaulniers, Guy; Lessard, François; Plana, Isaac; Sanchis, José M. is a Computer Science article available to read on EtoBox.

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

Author
Benavent, Enrique; Corberán, Ángel; Desaulniers, Guy; Lessard, François; Plana, Isaac; Sanchis, José M.
Publisher
John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0028-3045)
Published
2014
Language
EN
Field
Computer Science (Physical Sciences)

More by Benavent, Enrique; Corberán, Ángel; Desaulniers, Guy; Lessard, François; Plana, Isaac; Sanchis, José M.

Browse all works by Benavent, Enrique; Corberán, Ángel; Desaulniers, Guy; Lessard, François; Plana, Isaac; Sanchis, José M.