- -

A cutting plane algorithm for the General Routing Problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A cutting plane algorithm for the General Routing Problem

Show full item record

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

Files in this item

Item Metadata

Title: A cutting plane algorithm for the General Routing Problem
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
[EN] The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural ...[+]
Subjects: Valid inequalities , Cutting planes , General Routing Problem , Rural Postman Problem , Graphical Travelling Salesman Problem
Copyrigths: Reserva de todos los derechos
Source:
Mathematical Programming. (issn: 0025-5610 )
DOI: 10.1007/PL00011426
Publisher:
Springer-Verlag
Publisher version: https://doi.org/10.1007/PL00011426
Thanks:
The authors would like to thank three anonymous referees for their helpful comments and suggestions that have greatly improved the contents and presentation of the paper. The contribution by A. Corber´an & J.M. Sanchis has ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record