- -

A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem

Show full item record

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

Files in this item

Item Metadata

Title: A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem
Author: Fernández de Córdoba, Pedro García-Raffi, L. M. Sanchís Llopis, José María
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
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: Rural postman problem , Routing problems , Monte Carlo methods
Copyrigths: Cerrado
Source:
Computers & Operations Research. (issn: 0305-0548 )
Publisher:
Elsevier
Publisher version: https://www.journals.elsevier.com/computers-and-operations-research
Type: Artículo

This item appears in the following Collection(s)

Show full item record