New inequalities for the General Routing Problem

European Journal of Operational Research

Volumn 96, Issue 2, 1997, Pages 317-322

  Letchford, Adam N ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

General Routing Problem; Separation algorithms; Valid inequalities

Indexed keywords

ALGORITHMS; OPTIMIZATION; POSTAL SERVICES; ROADS AND STREETS; TERMINOLOGY;

GENERAL ROUTING PROBLEM; SEPARATION ALGORITHMS; VALID INEQUALITIES;

TRANSPORTATION ROUTES;

EID: 0030857736     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00346-3     Document Type: Article

References (13)

1. Corberan, A. (1995), Private communication.
2. Corberan, A., and Sanchis, J.M. (1994), "A polyhedral approach to the Rural Postman Problem", European Journal of Operational Research 79, 95-114.
3. Corberan, A., and Sanchis, J.M. (1995), "The General Routing Problem polyhedron", Working Paper, Department of Statistics and Operations Research, University of Valencia, Spain.
4. Cornuejols, G., Fonlupt, J., and Naddef, D. (1985), "The travelling salesman on a graph and some related integer polyhedra", Mathematical Programming 33, 1-27.
5. Eiselt, H.A., Gendreau, M., and Laporte, G. (1995), "Arc-routing problems, Part 2: The Rural Postman Problem", Operations Research 43, 399-414.
6. Fleischmann, B. (1985), "A cutting-plane procedure for the Travelling Salesman on a road network", European Journal of Operational Research 21, 307-317.
7. Lenstra, J.K., and Rinnooy Kan, A.H.G. (1976), "On general routing problems", Networks 6, 273-280.
8. Naddef, D., and Rinaldi, G. (1991), "The symmetric travelling salesman polytope and its graphical relaxation: Composition of valid inequalities", Mathematical Programming 51, 359-400.
9. Naddef, D., and Rinaldi, G. (1993), "The Graphical Relaxation: A new framework for the symmetric travelling salesman polytope", Mathematical Programming 58, 53-88.
10. Nemhauser, G.L., and Wolsey, L.A. (1988), Integer & Combinatorial Optimisation, Wiley, New York.
11. Orloff, CS. (1974), "A fundamental problem in vehicle routing", Networks 4, 35-64.
12. Padberg, M.W., and Rao, M.R. (1982), "Odd minimum cut-sets and b-matchings", Mathematics of Operations Research 7, 67-80.
13. Padberg, M., and Rinaldi, G. (1990), "Facet identification for the symmetric Travelling Salesman Problem", Mathematical Programming 47, 219-257.