The following publications are possibly variants of this publication:
- K-vehicles windy rural postman problemEnrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis. networks, 58(4):255-272, 2011. [doi]
- Min-Max ::::K::::-vehicles windy rural postman problemEnrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis. networks, 54(4):216-226, 2009. [doi]
- A metaheuristic for the min-max windy rural postman problem with K vehiclesEnrique Benavent, Ángel Corberán, José M. Sanchis. cms, 7(3):269-287, 2010. [doi]
- Aesthetic considerations for the min-max K-Windy Rural Postman ProblemÁngel Corberán, Bruce L. Golden, Oliver Lum, Isaac Plana, José M. Sanchis. networks, 70(3):216-232, 2017. [doi]
- New heuristic algorithms for the windy rural postman problemEnrique Benavent, Angel Corberán, Estefanía Piñana, Isaac Plana, José M. Sanchis. cor, 32:3111-3128, 2005. [doi]
- Lower bounds and heuristics for the Windy Rural Postman ProblemEnrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo. eor, 176(2):855-869, 2007. [doi]
- A branch-and-cut algorithm for the profitable windy rural postman problemThais Ávila, Angel Corberán, Isaac Plana, José M. Sanchis. eor, 249(3):1092-1101, 2016. [doi]
- New results on the Windy Postman ProblemAngel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis. mp, 132(1-2):309-332, 2012. [doi]