- -

The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra

Mostrar el registro sencillo del ítem

Ficheros en el ítem

[Cerrado]
Nombre: EJORgrp1998.pdf
Tamaño: 865.0Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Corberán, A. es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2018-04-21T04:24:09Z
dc.date.available 2018-04-21T04:24:09Z
dc.date.issued 1998 es_ES
dc.identifier.issn 0377-2217 es_ES
dc.identifier.uri http://hdl.handle.net/10251/100814
dc.description.abstract [EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical Traveling Salesman Problem (GTSP) and, thus, is NP -hard. We describe a formulation of the problem such that from every non-trivial facet-inducing inequality for the RPP and GTSP polyhedra, we obtain facet-inducing inequalities for the GRP polyhedron, We describe a new family of facet-inducing inequalities for the GRP, the honeycomb constraints, which seem to be very useful for solving GRP and RPP instances. Finally, new classes of facets obtained by composition of facet-inducing inequalities are presented. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof European Journal of Operational Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject General Routing Problem es_ES
dc.subject Rural Postman Problem es_ES
dc.subject Graphical Traveling Salesman Problem es_ES
dc.subject Routing es_ES
dc.subject Facets of polyhedra es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/S0377-2217(96)00337-2 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 Corberán, A.; Sanchís Llopis, JM. (1998). The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra. European Journal of Operational Research. 108(3):538-550. doi:10.1016/S0377-2217(96)00337-2 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1016/S0377-2217(96)00337-2 es_ES
dc.description.upvformatpinicio 538 es_ES
dc.description.upvformatpfin 550 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 108 es_ES
dc.description.issue 3 es_ES
dc.relation.pasarela S\15905 es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem