Zigzag inequalities: A new class of facet-inducing inequalities for Arc Routing Problems

Mathematical Programming

Volumn 108, Issue 1, 2006, Pages 79-96

  Corberán, Angel ^a   Plana, Isaac ^a   Sanchis, José M ^b  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Arc Routing; Facets; Mixed Rural Postman Problem; Polyhedral Combinatorics; Windy General Routing Problem; Windy Rural Postman Problem

Indexed keywords

COMBINATORIAL MATHEMATICS; OPERATIONS RESEARCH;

ARC ROUTING; FACETS; MIXED RURAL POSTMAN PROBLEM; POLYHEDRAL COMBINATORICS; WINDY RURAL POSTMAN PROBLEM;

PROBLEM SOLVING;

EID: 33646725763     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0643-y     Document Type: Article

References (21)

1. Benavent, E., Carrotta, A., Corberán, A., Sanchis, J.M., Vigo, D.: Lower Bounds and Heuristics for the Windy Rural Postman Problem. Technical Report TR03-2003. Department of Statistics and OR, University of Valencia (Spain). Submitted to EJOR 2003
2. Benavent, E., Corberán, A., Piñana, E., Plana, I., Sanchis, J.M.: New Heuristics for the Windy Rural Postman Problem. To appear in Comput. Oper. Res. 2005
3. Chopra, S., Rinaldi, G.: The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities. SIAM J. Discrete Math. 9 (4), 602-624 (1996)
4. Christofides, N., Benavent, E., Campos, V., Corberán, A., Mota, E.: An Optimal Method for the Mixed Postman Problem. In: P. Thoft-Christensen (ed.) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, 59. Berlin: Springer-Verlag 1984
5. Christofides, N., Campos, V., Corberán, A., Mota, E.: An Algorithm for the Rural Postman Problem. Report IC.OR. 81.5. Imperial College, London 1981
6. Corberán, A., Mejía, G., Sanchis, J.M.: New Results on the Mixed General Routing Problem. To appear in Oper. Res. 2005
7. Corberán, A., Mota, E., Sanchis, J.M.: A Comparison of Two Different Formulations for Arc Routing Problems on Mixed Graphs. To appear in Comput. Oper. Res. 2005
8. Corberán, A., Plana, I., Sanchis, J.M.: On the Windy General Routing Polyhedron. In preparation 2005
9. Corberán, A., Romero, A., Sanchis, J.M.: The Mixed General Routing Problem Polyhedron. Math. Programming 96, 103-137 (2003)
10. Cornuèjols, G., Fonlupt, J., Naddef. D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming 33, 1-27 (1985)
11. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc-Routing Problems, Part 2: the Rural Postman Problem. Oper. Res. 43, 399-414 (1995)
12. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, NJ 1962
13. Grötschel, M., Win, Z.: On the Windy Postman Polyhedron. Report No. 75, Schwerpunktprogram der Deutschen Forschungsgemeinschaft, Universität Augsburg, Germany 1988
14. Grötschel, M., Win, Z.: A Cutting Plane Algorithm for the Windy Postman Problem. Math. Programming 55, 339-358 (1992)
15. Guan, M.: On the Windy Postman Problem. Discrete Applied Mathematics 9, 41-46 (1984)
16. Letchford, A.: New inequalities for the General Routing Problem. Eur. J. Oper. Res. 96, 317-322 (1997)
17. Minieka, E.: The Chinese Postman Problem for Mixed Networks. Management Sci. 25, 643-648 (1979)
18. Naddef, D., Rinaldi, G.: The Symmetric Traveling Salesman Poly tope and its Graphical Relaxation: Composition of Valid Inequalities. Math. Programming 51, 359-400 (1991)
19. Nobert, Y., Picard, J.C.: An Optimal Algorithm for the Mixed Chinese Postman Problem. Networks 27, 95-108 (1996)
20. Ralphs, T.K.: On the Mixed Chinese Postman Problem. Oper. Res. Lett. 14, 123-127 (1993)
21. Win, Z.: Contributions to Routing Problems. PhD Dissertation, University of Augsburg, Germany 1987