Corberán, Á.; Plana, I.; Sanchís Llopis, JM.; Segura-Martínez, P. (2024). Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem. Computers & Operations Research. 162. https://doi.org/10.1016/j.cor.2023.106482
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/203288
Title: | Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem | |
Author: | Corberán, Ángel Plana, Isaac | |
UPV Unit: |
|
|
Issued date: |
|
|
Abstract: |
[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 ...[+]
|
|
Subjects: |
|
|
Copyrigths: | Reconocimiento - No comercial (by-nc) | |
Source: |
|
|
DOI: |
|
|
Publisher: |
|
|
Publisher version: | https://doi.org/10.1016/j.cor.2023.106482 | |
Project ID: |
|
|
Thanks: |
|
|
Type: |
|