- -

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

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

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

Show full item record

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

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

Files in this item

Item Metadata

Title: A comparison of two different formulations for Arc Routing Problems on Mixed graphs
Author: Corberán, A. Mota, E. Sanchís Llopis, José María
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
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 ...[+]
Subjects: Arc routing , Mixed Chinese postman problem , Mixed rural postman problem , Mixed general routing problem
Copyrigths: Reserva de todos los derechos
Source:
Computers & Operations Research. (issn: 0305-0548 )
DOI: 10.1016/j.cor.2005.02.010
Publisher:
Elsevier
Publisher version: https://doi.org/10.1016/j.cor.2005.02.010
Project ID:
info:eu-repo/grantAgreement/MICYT//TIC2003-05982-C05-01/
info:eu-repo/grantAgreement/GVA//Grupos 03%2F189/
Thanks:
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 ...[+]
Type: Artículo

recommendations

 

This item appears in the following Collection(s)

Show full item record