The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra

European Journal of Operational Research

Volumn 108, Issue 3, 1998, Pages 538-550

  Corberan A ^a   Sanchis, J M ^b  

^a UNIVERSITY OF VALENCIA   (Spain)

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

Author keywords

Facets of polyhedra; General routing problem; Graphical traveling salesman problem; Routing; Rural postman problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

GENERAL ROUTING PROBLEM; GRAPHICAL TRAVELING SALESMAN PROBLEM; INEQUALITY; POLYHEDRA; RURAL POSTMAN PROBLEM;

OPERATIONS RESEARCH;

EID: 0032143226     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00337-2     Document Type: Article

References (16)

1. Assad, A.A., and Golden, B.L., Arc routing methods and applications, in: M.O. Ball et al. (eds.), Network Routing, North-Holland, Amsterdam, 1995, 375-484.
2. Belenguer, J.M., and Benavent, E., Polyhedral results on the Capacited Arc Routing Problem, Technical Report, University of Valencia, 1990.
3. Christofides, N., Campos, V., Corberán, A., and Mota, E., An algorithm for the Rural Postman Problem, Imperial College Report, London, 1981.
4. Corberán, A., and Sanchis, J.M., A polyhedral approach to the Rural Postman Problem, European Journal of Operational Research 79 (1994) 95-114.
5. Cornuejols, G., Fonlupt, J., and Naddef, D., The Traveling Salesman Problem on a graph and some related integer polyhedra, Mathematical Programming 33 (1985) 1-27.
6. Eiselt, H.A., Gendreau, M., and Laporte, G., Arc Routing Problems, Part 2: The Rural Postman Problem, Operations Research 43 (1995) 399-414.
7. Fleischmann, B., A cutting-plane procedure for the Traveling Salesman Problem on a road network, European Journal of Operational Research 21 (1985) 307-317.
8. Fleischmann, B., A new class of cutting planes for the Symmetric Traveling Salesman Problem, Mathematical Programming 40 (1988) 225-246.
9. Letchford, A.N., New inequalities for the General Routing Problem, forthcoming in European Journal of Operational Research.
10. Letchford, A.N., Further inequalities for the General Routing Problem Polyhedron, Working Paper, Management School, Lancaster University, 1996; submitted to European Journal of Operational Research.
11. Lenstra, J.K., and Rinnooy Kan, A.H.G., On the General Routing Problem, Networks 6 (1976) 273-280.
12. Naddef, D., and Rinaldi, G., The Symmetric Traveling Salesman Polytope and its graphical relaxation: Composition of valid inequalities, Mathematical Programming 51 (1991) 359-400.
13. Naddef, D., and Rinaldi, G., The Graphical Relaxation: A new framework for the Symmetric Travelling Salesman Polytope, Mathematical Programming 58 (1993) 53-88.
14. Orloff, C., A fundamental problem in vehicle routing, Networks 4 (1974) 35-64.
15. Pandit, R., and Muralidharan, B., A capacitated general routing problem on mixed networks, Computers & Operations Research 22/5 (1995) 465-478.
16. Sanchis, J.M., El poliedro del problema del cartero rural, Ph.D. Thesis, Universidad de Valencia, 1990.