- -

Browsing by Author "Corberán, Angel"

RiuNet: Institutional repository of the Polithecnic University of Valencia

Browsing by Author "Corberán, Angel"

Sort by: Order: Results:

  • thumb
    A branch-and-cut algorithm for the maximum benefit Chinese postman problem 
    Corberán, Angel; Plana, Isaac; Rodríguez-Chía, Antonio Manuel; Sanchís Llopis, José María (Springer-Verlag, 2013-10)
    [EN] The Maximum Benefit Chinese Postman Problem (MBCPP) is an NP-hard problem that considers several benefits associated with each edge, one for each time the edge is traversed with a service. The objective is to find a ...
  • thumb
    Drone arc routing problems 
    Campbell, James F.; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (John Wiley & Sons, 2018)
    [EN] In this article, we present some drone arc routing problems (Drone ARPs) and study their relation with well-known postman ARPs. Applications for Drone ARPs include traffic monitoring by flying over roadways, infrastructure ...
  • thumb
    New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Windy Rural Postman Problem 
    Benavent López, Enrique; Corberán, Angel; Plana, Isaac; Sanchís Llopis, José María (WILEY-BLACKWELL, 2011-11)
    [EN] The min-max windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the ...
  • thumb
    New Results on the Mixed General Routing Problem 
    Corberán, Angel; Mejía, Gustavo; Sanchís Llopis, José María (Institute for Operations Research and the Management Sciences, 2005-03)
    [EN] In this paper, we deal with the polyhedral description and the resolution of the Mixed General Routing Problem. This problem, in which the service activity occurs both at some of the nodes and at some of the arcs and ...
  • thumb
    New results on the Windy Postman Problem 
    Corberán, Angel; Oswald, Marcus; Plana, Isaac; Reinelt, Gerhard; Sanchís Llopis, José María (Springer-Verlag, 2012-04)
    [EN] In this paper, we study the Windy Postman Problem (WPP). This is a well-known Arc Routing Problem that contains the Mixed Chinese Postman Problem (MCPP) as a special case. We extend to arbitrary dimension some new ...
  • 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. ...