Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por palabra clave "Rural Postman Problem"

Mostrando ítems 1-4 de 4

A cutting plane algorithm for the General Routing Problem

Corberan, Angel; Letchford, Adam; Sanchís Llopis, José María (Springer-Verlag, 2001)

[EN] The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural ...
The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra

Corberán, A.; Sanchís Llopis, José María (Elsevier, 1998)

[EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical ...
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 ...
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem

Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula (Elsevier, 2024-02)

[EN] The Rural Postman Problem (RPP) is one of the most well-known problems in arc routing. Given an undirected graph, the RPP consists of finding a closed walk traversing and servicing a given subset of edges with minimum ...

Mostrando ítems 1-4 de 4

Listar por palabra clave "Rural Postman Problem"

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

Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Ayuda RiuNet

Admin. UPV

Listar por palabra clave "Rural Postman Problem"