- -

The mixed general routing polyhedron

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by


The mixed general routing polyhedron

Show full item record

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

Files in this item

Item Metadata

Title: The mixed general routing polyhedron
Author: Corberán, Angel Romero Rozalén, Antonio 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:
[EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most ...[+]
Subjects: Polyhedral combinatorics , Facets , routing , Arc Routing , Rural Postman Problem , General Routing Problem , Mixed Chinese Postman Problem
Copyrigths: Reserva de todos los derechos
Mathematical Programming. (issn: 0025-5610 )
DOI: 10.1007/s10107-003-0391-9
Publisher version: http://doi.org/10.1007/s10107-003-0391-9
Project ID:
info:eu-repo/grantAgreement/MICINN//MTM2009-14039-C06-02/ES/Modelos Y Metodos De Programacion Matematica Y Sus Aplicaciones (Optimos2)/
info:eu-repo/grantAgreement/MICINN//MTM2010-19576-C02-02/ES/DISEÑO OPTIMO EN REDES LOGISTICAS/
info:eu-repo/grantAgreement/Juanta de Andalucía//FQM-5849/ES//
The authors wish to thank the Ministerio de Innovación y Ciencia/FEDER of Spain (projects MTM2009-14039-C06-02, MTM2010-19576-C02-02 and DE2009-0057) and Junta de Andalucía/FEDER (grant number FQM-5849) for its support. ...[+]
Type: Artículo



This item appears in the following Collection(s)

Show full item record