- -

Browsing by Subject "Arc routing problems"

RiuNet: Institutional repository of the Polithecnic University of Valencia

Browsing by Subject "Arc routing problems"

Sort by: Order: Results:

  • Icon
    Aesthetic considerations for the min-max K-Windy Rural Postman Problem 
    Corberán, A.; Golden, Bruce; Lum, Oliver; PLANA, ISAAC; Sanchís Llopis, José María (John Wiley & Sons, 2017-10)
    [EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal ...
  • Icon
    The Windy Clustered Prize-Collecting Arc-Routing Problem 
    Corberan, Ángel; Fernandez, Elena; Franquesa, Carles; Sanchís Llopis, José María (INFORMS (Institute for Operations Research and Management Sciences), 2011)
    This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent ...
  • thumb
    The Windy General Routing Polyhedron: A global view of many known Arc Routing Polyhedra 
    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. ...