- -

A Branch & Cut algorithm for the Windy General Routing Problem and Special Cases

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A Branch & Cut algorithm for the Windy General Routing Problem and Special Cases

Show full item record

Corberán, A.; Plana, I.; Sanchís Llopis, JM. (2007). A Branch & Cut algorithm for the Windy General Routing Problem and Special Cases. Networks. 49(4):245-257. https://doi.org/10.1002/net.20176

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

Files in this item

Item Metadata

Title: A Branch & Cut algorithm for the Windy General Routing Problem and Special Cases
Author: Corberán, A. Plana, I. 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] In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real-life applications. The Branch & Cut ...[+]
Subjects: Branch & cut , Arc routing , Windy general routing problem , Windy rural postman problem
Copyrigths: Cerrado
Source:
Networks. (issn: 0028-3045 )
DOI: 10.1002/net.20176
Publisher:
John Wiley & Sons
Publisher version: https://doi.org/10.1002/net.20176
Thanks:
Contract grant sponsors: Ministerio de Ciencia y Tecnología of Spain; Generalitat Valenciana
Type: Artículo

This item appears in the following Collection(s)

Show full item record