Abstract
We study the class of polytopes associated with the 0/1-variable formulation by [G. Ghiani and G. Laporte, Math. Program., 87 (2000), pp. 467--481] of the rural postman problem and general routing problem. We introduce a technique called switching, which allows one to obtain new valid or facet-defining inequalities from known ones. We study the switched forms which can be obtained from two important types of known valid inequalities, namely, so called path-bridge [A. N. Letchford, Eur. J. Oper. Res., 96 (1997), pp. 317--322] and honeycomb [A. Corberan and J. M. Sanchis, Eur. J. Oper. Res., 108 (1998), pp. 538--550] inequalities. For the switched path-bridge inequalities, a generic blueprint for separation routines is developed. We give a polynomial time separation algorithm for a special subclass of these inequalities.
Sign-in/Register to access full text options 
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
