- -

Listar por palabra clave "Polyhedral combinatorics"

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

Listar por palabra clave "Polyhedral combinatorics"

Ordenar por:Orden:Resultados:

  • 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 mixed general routing polyhedron 
    Corberán, Angel; Romero Rozalén, Antonio; Sanchís Llopis, José María (Springer-Verlag, 2003)
    [EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most ...