| Article ID: | iaor19991221 |
| Country: | Netherlands |
| Volume: | 96 |
| Issue: | 2 |
| Start Page Number: | 317 |
| End Page Number: | 322 |
| Publication Date: | Jan 1997 |
| Journal: | European Journal of Operational Research |
| Authors: | Letchford Adam N. |
| Keywords: | postman problem |
A large new class of valid inequalities is introduced for the General Routing Problem which properly contains the class of ‘K-C constraints’. These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time.