- -

A cutting plane algorithm for the General Routing Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

A cutting plane algorithm for the General Routing Problem

Show simple item record

Files in this item

dc.contributor.author Corberan, Angel es_ES
dc.contributor.author Letchford, Adam es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2018-04-14T04:19:10Z
dc.date.available 2018-04-14T04:19:10Z
dc.date.issued 2001 es_ES
dc.identifier.issn 0025-5610 es_ES
dc.identifier.uri http://hdl.handle.net/10251/100424
dc.description.abstract [EN] The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions. es_ES
dc.description.sponsorship The authors would like to thank three anonymous referees for their helpful comments and suggestions that have greatly improved the contents and presentation of the paper. The contribution by A. Corberán & J.M. Sanchis has been partially supported by the Ministerio de Ciencia y Tecnología of Spain (Ref. TIC2000-1750-C06-01).
dc.language Inglés es_ES
dc.publisher Springer-Verlag es_ES
dc.relation.ispartof Mathematical Programming es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Valid inequalities es_ES
dc.subject Cutting planes es_ES
dc.subject General Routing Problem es_ES
dc.subject Rural Postman Problem es_ES
dc.subject Graphical Travelling Salesman Problem es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title A cutting plane algorithm for the General Routing Problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1007/PL00011426 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MICYT//TIC2000-1750-C06-01/
dc.rights.accessRights Abierto 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 Corberan, A.; Letchford, A.; Sanchís Llopis, JM. (2001). A cutting plane algorithm for the General Routing Problem. Mathematical Programming. 90(2):291-316. https://doi.org/10.1007/PL00011426 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1007/PL00011426 es_ES
dc.description.upvformatpinicio 291 es_ES
dc.description.upvformatpfin 316 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 90 es_ES
dc.description.issue 2 es_ES
dc.relation.pasarela S\21053 es_ES
dc.contributor.funder Ministerio de Ciencia y Tecnología


This item appears in the following Collection(s)

Show simple item record