Benavent E., Carrotta A., Corberán A., Sanchis J.M., Vigo D.: Lower bounds and heuristics for the windy rural postman problem. Eur. J. Oper. Res. 176, 855–869 (2007)

Brucker P. The Chinese postman problem for mixed graphs. In Proceedings of international workshop. Lecture Notes in Computer Science 100, 354–366 (1981)

Caprara A., Fischetti M.: $${\{0,\frac{1}{2}\}}$$ -Chvátal-Gomory cuts. Math. Program. 74, 221–235 (1996)
[+]

Benavent E., Carrotta A., Corberán A., Sanchis J.M., Vigo D.: Lower bounds and heuristics for the windy rural postman problem. Eur. J. Oper. Res. 176, 855–869 (2007)

Brucker P. The Chinese postman problem for mixed graphs. In Proceedings of international workshop. Lecture Notes in Computer Science 100, 354–366 (1981)

Caprara A., Fischetti M.: $${\{0,\frac{1}{2}\}}$$ -Chvátal-Gomory cuts. Math. Program. 74, 221–235 (1996)

Caprara A., Fischetti M., Letchford A.N.: On the separation of maximally violated mod-k cuts. Math. Program. 87, 37–56 (2000)

Christof, T., Loebel, A.: PORTA—a polyhedron representation algorithm www.informatik.uni-heidelberg.de/groups/comopt/software/PORTA/ (1998)

Christofides, N., Benavent, E., Campos, V., Corberán, A., Mota, E.: An optimal method for the mixed postman problem. In Thoft-Christensen, P. (ed.) System Modelling and Optimization. Lecture Notes in Control and Information Sciences 59, Springer (1984)

Corberán A., Plana I., Sanchis J.M.: Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems. Math. Program. 108, 79–96 (2006)

Corberán A., Plana I., Sanchis J.M.: A branch & cut algorithm for the windy general routing problem and special cases. Networks 49, 245–257 (2007)

Corberán, A., Plana I., Sanchis, J.M.: Arc routing problems: data instances. www.uv.es/corberan/instancias.htm (2007)

Corberán A., Plana I., Sanchis J.M.: The windy general routing polyhedron: a global view of many known arc routing polyhedra. SIAM J. Discrete Math. 22, 606–628 (2008)

Grötschel, M., Win, Z.: On the windy postman polyhedron. Report No. 75, Schwerpunktprogram der Deutschen Forschungsgemeinschaft, Universität Augsburg, Germany (1988)

Grötschel M., Win Z.: A cutting plane algorithm for the Windy Postman Problem. Math. Program. 55, 339–358 (1992)

Guan M.: On the Windy Postman Problem. Discrete Appl. Math. 9, 41–46 (1984)

Minieka E.: The Chinese postman problem for mixed networks. Manage. Sci. 25, 643–648 (1979)

Naddef D., Rinaldi G.: The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities. Math. Program. 51, 359–400 (1991)

Oswald M., Reinelt G., Seitz H.: Applying mod-k cuts for solving linear ordering problems. TOP 17, 158–170 (2009)

Papadimitriou C.H.: On the complexity of edge traversing. J. Assoc. Comput. Mach. 23, 544–554 (1976)

Ralphs T.K.: On the mixed Chinese postman problem. Oper. Res. Lett. 14, 123–127 (1993)

Wenger, K.: Generic Cut Generation Methods for Routing Problems. PhD Dissertation, University of Heidelberg, Germany (2004)

Win, Z.: Contributions to Routing Problems. PhD Dissertation, University of Augsburg, Germany (1987)

Win Z.: On the Windy Postman Problem on eulerian graphs. Math. Program. 44, 97–112 (1989)

Zaragoza Martínez F.J.: Series-parallel graphs are windy postman perfect. Discrete Math. 308, 1366–1374 (2008)

[-]