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.


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
Departments: Lancaster University Management School > Management Science
ID Code: 43271
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 17:56
Refereed?: Yes
Published?: Published
Last Modified: 22 Jan 2020 06:00
URI: https://eprints.lancs.ac.uk/id/eprint/43271

Actions (login required)

View Item View Item