- -

Lower bounds and heuristics for the Windy Rural Postman Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Lower bounds and heuristics for the Windy Rural Postman Problem

Show full item record

Benavent, E.; Carrotta, A.; Corberán, A.; Sanchís Llopis, JM.; Vigo, D. (2020). Lower bounds and heuristics for the Windy Rural Postman Problem. European Journal of Operational Research. 176(2):855-869. https://doi.org/10.1016/j.ejor.2005.09.021

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

Files in this item

[Cerrado]
Name: Benavent;Carrotta ...
Size: 536.8Kb
Format: PDF
Description: Versión editorial
Request a copy of the document

Item Metadata

Title: Lower bounds and heuristics for the Windy Rural Postman Problem
Author: Benavent, E. Carrotta, A. Corberán, A. Sanchís Llopis, José María Vigo, D.
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
[EN] In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains several important Arc Routing Problems as special cases and has very ...[+]
Subjects: Routing , Heuristics , Windy Rural Postman Problem , Cutting planes
Copyrigths: Cerrado
Source:
European Journal of Operational Research. (issn: 0377-2217 )
DOI: 10.1016/j.ejor.2005.09.021
Publisher:
Elsevier
Publisher version: https://doi.org/10.1016/j.ejor.2005.09.021
Thanks:
The contribution by E. Benavent, A. Corberán and J.M. Sanchis has been supported by the Ministerio de Ciencia y Tecnología of Spain through grant TIC2003-05982-C05-01 (partially financed with FEDER funds) and by the ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record