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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
