论文信息 - New inequalities for the General Routing Problem

New inequalities for the General Routing Problem

Abstract A large new class of valid inequalities is introduced for the General Routing Problem which properly contains the class of ‘K-C constraints’. These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time.

Adam N. Letchford

[1] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[2] Michel Gendreau,et al. Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

[3] Gérard Cornuéjols,et al. The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[4] Ángel Corberán,et al. The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra , 1998, Eur. J. Oper. Res..

[5] Giovanni Rinaldi,et al. The graphical relaxation: A new framework for the symmetric traveling salesman polytope , 1993, Math. Program..

[6] Giovanni Rinaldi,et al. Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..

[7] Jan Karel Lenstra,et al. On general routing problems , 1976, Networks.

[8] C. S. Orloff. A fundamental problem in vehicle routing , 1974, Networks.

[9] Á. Corberán,et al. A polyhedral approach to the rural postman problem , 1994 .

[10] B. Fleischmann. A cutting plane procedure for the travelling salesman problem on road networks , 1985 .

[11] Giovanni Rinaldi,et al. The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities , 1991, Math. Program..