Fernández De Córdoba, P.; García-Raffi, LM.; Sanchís Llopis, JM. (1998). A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem. Computers & Operations Research. 25(12):1097-1106. http://hdl.handle.net/10251/93709
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/93709
Title: | A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem | |
Author: | ||
UPV Unit: |
|
|
Issued date: |
|
|
Abstract: |
[EN] The Rural Postman Problem (RPP) consists of finding a minimum cost traversal of a specified are subset of a graph. Given that the RPP is a NP-hard problem, heuristic algorithms are interesting both to handle large ...[+]
|
|
Subjects: |
|
|
Copyrigths: | Cerrado | |
Source: |
|
|
Publisher: |
|
|
Publisher version: | https://www.journals.elsevier.com/computers-and-operations-research | |
Type: |
|