12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > New inequalities for the general routing problem
View graph of relations

« Back

New inequalities for the general routing problem

Research output: Contribution to journalJournal article

Published

<mark>Journal publication date</mark>24/01/1997
<mark>Journal</mark>European Journal of Operational Research
Issue2
Volume96
Number of pages6
Pages317-322
<mark>Original language</mark>English

Abstract

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.

Related projects