A cutting plane algorithm for the general routing problem

Corberan, A and Sanchis, J M and Letchford, A N (2001) A cutting plane algorithm for the general routing problem. Mathematical Programming, 90 (2). pp. 291-316. ISSN 0025-5610

Full text not available from this repository.

Abstract

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 Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions.

Item Type:
Journal Article
Journal or Publication Title:
Mathematical Programming
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
?? CUTTING PLANESGENERAL ROUTING PROBLEMRURAL POSTMAN PROBLEMARC ROUTINGMANAGEMENT SCIENCESOFTWAREMATHEMATICS(ALL)DISCIPLINE-BASED RESEARCH ??
ID Code:
43271
Deposited By:
Deposited On:
11 Jul 2011 17:56
Refereed?:
Yes
Published?:
Published
Last Modified:
19 Sep 2023 00:37