- -

A comparison of two different formulations for Arc Routing Problems on Mixed graphs

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

A comparison of two different formulations for Arc Routing Problems on Mixed graphs

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: Corberán;Mota;Sanchís ...
Tamaño: 1.220Mb
Formato: PDF
Descripción: Versión del Autor.
Abrir
[Cerrado]
Nombre: ComputersMota2006.pdf
Tamaño: 227.5Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Corberán, A. es_ES
dc.contributor.author Mota, E. es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.date.accessioned 2020-09-24T12:30:03Z
dc.date.available 2020-09-24T12:30:03Z
dc.date.issued 2006-12 es_ES
dc.identifier.issn 0305-0548 es_ES
dc.identifier.uri http://hdl.handle.net/10251/150667
dc.description.abstract [EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented. es_ES
dc.description.sponsorship Authors want to thank two anonymous referees for their careful reading of the manuscript. Also we thank the support given by the Ministerio de Ciencia y Tecnología of Spain through Grant TIC2003-05982-C05-01 and by the Generalitat Valenciana (Grupos 03/189). es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof Computers & Operations Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Arc routing es_ES
dc.subject Mixed Chinese postman problem es_ES
dc.subject Mixed rural postman problem es_ES
dc.subject Mixed general routing problem es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title A comparison of two different formulations for Arc Routing Problems on Mixed graphs es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.cor.2005.02.010 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MICYT//TIC2003-05982-C05-01/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/GVA//Grupos 03%2F189/ es_ES
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 Corberán, A.; Mota, E.; Sanchís Llopis, JM. (2006). A comparison of two different formulations for Arc Routing Problems on Mixed graphs. Computers & Operations Research. 33(12):3384-3402. https://doi.org/10.1016/j.cor.2005.02.010 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1016/j.cor.2005.02.010 es_ES
dc.description.upvformatpinicio 3384 es_ES
dc.description.upvformatpfin 3402 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 33 es_ES
dc.description.issue 12 es_ES
dc.relation.pasarela S\29879 es_ES
dc.contributor.funder Generalitat Valenciana es_ES
dc.contributor.funder Ministerio de Ciencia y Tecnología es_ES


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

Mostrar el registro sencillo del ítem