- -

A GRASP for the Mixed Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A GRASP for the Mixed Postman Problem

Show full item record

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/100592

Files in this item

Item Metadata

Title: A GRASP for the Mixed Postman Problem
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
[EN] Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed ...[+]
Subjects: Metaheuristics , Routing , Chinese postman , GRASP
Copyrigths: Reserva de todos los derechos
Source:
European Journal of Operational Research. (issn: 0377-2217 )
DOI: 10.1016/S0377-2217(01)00296-X
Publisher:
Elsevier
Publisher version: https://doi.org/10.1016/S0377-2217(01)00296-X
Type: Artículo

This item appears in the following Collection(s)

Show full item record