Buscar en RiuNet

Listar

Mostrando ítems 1-3 de 3

A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem

Ávila, T.; Corberán, A.; Plana, I.; Sanchís Llopis, José María (Elsevier, 2016-03-16)

[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, ...
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 ...
Topological n-cells and Hilbert cubes in inverse limits

Rubin, Leonard R. (Universitat Politècnica de València, 2018-04-02)

[EN] It has been shown by S. Mardešić that if a compact metrizable space X has dim X ≥ 1 and X is the inverse limit of an inverse sequence of compact triangulated polyhedra with simplicial bonding maps, then X must contain ...

Mostrando ítems 1-3 de 3