Polyhedral Theory for Arc Routing Problems

As explained in Chapter 4, most realistic Arc Routing Problems are known to be NP-hard. Therefore we can expect that there will be certain instances which are impossible to solve to optimality within a reasonable time. However, this does not mean that all instances will be impossible to solve. It may well be that an instance which arises in practice has some structure which makes it amenable to solution by an optimization algorithm. Since, in addition, significant costs are often involved in realworld instances, research into devising optimization algorithms is still regarded as important.

[1]  H. Weyl.  Elementare Theorie der konvexen Polyeder , 1934 .

[2]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[3]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[4]  Nicos Christofides.  The optimum traversal of a graph , 1973 .

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

[6]  Christos H. Papadimitriou,et al.  On the complexity of edge traversing , 1976, J. ACM.

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

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Gary J. Koehler,et al.  The mixed postman problem , 1979, Discret. Appl. Math..

[10]  Ulrich Derigs,et al.  The Chinese Postman Problem , 1980 .

[11]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[12]  Richard M. Karp,et al.  On Linear Characterizations of Combinatorial Optimization Problems , 1982, SIAM J. Comput..

[13]  Ángel Corberán,et al.  An optimal method for the mixed postman problem , 1984 .

[14]  Meigu Guan,et al.  On the windy postman problem , 1984, Discret. Appl. Math..

[15]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

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

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

[18]  Ángel Corberán,et al.  An algorithm for the Rural Postman problem on a directed graph , 1986 .

[19]  Michael O. Ball,et al.  Sequencing of Insertions in Printed Circuit Board Assembly , 1988, Oper. Res..

[20]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[21]  Zaw Win,et al.  On the Windy Postman Problem on eulerian graphs , 1989, Math. Program..

[22]  Thomas L. Magnanti,et al.  Capacitated trees, capacitated routing, and associated polyhedra , 1990 .

[23]  M. R. Rao,et al.  (1,k)-configuration facets for the generalized assignment problem , 1990, Math. Program..

[24]  M. R. Rao,et al.  The generalized assignment problem: Valid inequalities and facets , 1990, Math. Program..

[25]  J. Araque.  Lots of combs of different sizes for vehicle routing , 1990 .

[26]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[27]  Martin Grötschel,et al.  A cutting plane algorithm for the windy postman problem , 1992, Math. Program..

[28]  Maurice Queyranne,et al.  On the convex hull of feasible solutions to certain combinatorial problems , 1992, Oper. Res. Lett..

[29]  Ted K. Ralphs,et al.  On the mixed Chinese postman problem , 1993, Oper. Res. Lett..

[30]  Gérard Cornuéjols,et al.  Polyhedral study of the capacitated vehicle routing problem , 1993, Math. Program..

[31]  J. Henry,et al.  System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, Compiègne, France, July 5-9, 1993 , 1994, System Modelling and Optimization.

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

[33]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

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

[35]  Wen Lea Pearn,et al.  Algorithms for the rural postman problem , 1995, Comput. Oper. Res..

[36]  J. Picard,et al.  An optimal algorithm for the mixed Chinese postman problem , 1996 .

[37]  G. Reinelt,et al.  Combinatorial optimization and small polytopes , 1996 .

[38]  Adam N. Letchford.  New inequalities for the General Routing Problem , 1997 .

[39]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

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

[41]  José-Manuel Belenguer,et al.  The Capacitated Arc Routing Problem: Valid Inequalities and Facets , 1998, Comput. Optim. Appl..

[42]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[43]  Adam N. Letchford,et al.  The rural postman problem with deadline classes , 1998, Eur. J. Oper. Res..

[44]  Adam N. Letchford,et al.  The general routing polyhedron: A unifying framework , 1999, Eur. J. Oper. Res..

[45]  Gilbert Laporte,et al.  A branch-and-cut algorithm for the Undirected Rural Postman Problem , 2000, Math. Program..