- -

Listar por palabra clave "Chinese postman problem"

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Listar por palabra clave "Chinese postman problem"

Ordenar por:Orden:Resultados:

  • 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
    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 Chinese Postman Problem with Load-Dependent Costs 
    Corberán, Ángel; Erdogan, Gunes; Laporte, Gilbert; Plana, Isaac; Sanchís Llopis, José María (Institute for Operations Research and the Management Sciences, 2018)
    [EN] We introduce an interesting variant of the well-known Chinese postman problem (CPP). While in the CPP the cost of traversing an edge is a constant (equal to its length), in the variant we present here the cost of ...