- -

Listar por palabra clave "Rural postman Problem"

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

Listar por palabra clave "Rural 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 ...