- -

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 simple item record

Files in this item

dc.contributor.author Benavent, E. es_ES
dc.contributor.author Carrotta, A. es_ES
dc.contributor.author Corberán, A. es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.contributor.author Vigo, D. es_ES
dc.date.accessioned 2020-03-23T08:46:18Z
dc.date.available 2020-03-23T08:46:18Z
dc.date.issued 2020-01-16 es_ES
dc.identifier.issn 0377-2217 es_ES
dc.identifier.uri http://hdl.handle.net/10251/139159
dc.description.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 interesting real-life applications. Extensive computational experiments over different sets of instances are also presented. es_ES
dc.description.sponsorship 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 Generalitat Valenciana (Ref: GRUPOS03/174 and GRUPOS03/ 189). A. Carrotta and D. Vigo thank the Ministero Dell Istruzione, dell Università e della Ricerca (M.I.U.R.) and the Consiglio Nazionale delle Ricerche (C.N.R.), Italy, for the support given to this project. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation MCYT/TIC2003-05982-C05-01 es_ES
dc.relation GV/GRUPOS03/174 es_ES
dc.relation GV/GRUPOS03/189 es_ES
dc.relation.ispartof European Journal of Operational Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Routing es_ES
dc.subject Heuristics es_ES
dc.subject Windy Rural Postman Problem es_ES
dc.subject Cutting planes es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title Lower bounds and heuristics for the Windy Rural Postman Problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.ejor.2005.09.021 es_ES
dc.rights.accessRights Cerrado es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada es_ES
dc.description.bibliographicCitation 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 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1016/j.ejor.2005.09.021 es_ES
dc.description.upvformatpinicio 855 es_ES
dc.description.upvformatpfin 869 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 176 es_ES
dc.description.issue 2 es_ES
dc.relation.pasarela S\29893 es_ES
dc.contributor.funder Generalitat Valenciana es_ES
dc.contributor.funder Ministerio de Ciencia y Tecnología es_ES


This item appears in the following Collection(s)

Show simple item record