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.Official URL: http://dx.doi.org/10.1007/PL00011426
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: | Article |
|---|---|
| Journal or Publication Title: | Mathematical Programming |
| Uncontrolled Keywords: | cutting planes ; General Routing Problem ; Rural Postman Problem ; Arc Routing |
| Subjects: | UNSPECIFIED |
| Departments: | Lancaster University Management School > Management Science |
| ID Code: | 43271 |
| Deposited By: | ep_importer_pure |
| Deposited On: | 11 Jul 2011 18:56 |
| Refereed?: | Yes |
| Published?: | Published |
| Last Modified: | 26 Jul 2012 18:45 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/43271 |
Actions (login required)
| View Item |
