Corberán, A.; Plana, I.; Sanchís Llopis, José María(John Wiley & Sons, 2007-07)
[EN] In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real-life applications. The Branch & Cut ...
Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María(Society for Industrial and Applied Mathematics, 2008-03-21)
[EN] The windy postman problem consists of finding a minimum cost traversal of all of the edges of an undirected graph with two costs associated with each edge, representing the costs of traversing it in each direction. ...