Linear Programming Based Methods for Solving Arc Routing Problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (53)
Flows in networks
1962 • 4,199 citations
Knapsack Problems: Algorithms and Computer Implementations
1991 • 3,333 citations
Maximum matching and a polyhedron with 0,1-vertices
1965 • 1,719 citations
Outline of an algorithm for integer solutions to linear programs
1958 • 1,369 citations
Solution of a Large-Scale Traveling-Salesman Problem
2009 • 1,314 citations
Solution of a Large-Scale Traveling-Salesman Problem
1954 • 1,141 citations
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
1991 • 1,056 citations
Matching, Euler tours and the Chinese postman
1973 • 979 citations
Multi-Terminal Network Flows
1961 • 959 citations
Solving Large-Scale Zero-One Linear Programming Problems
1983 • 675 citations
Capacitated arc routing problems
1981 • 547 citations
Odd Minimum Cut-Sets and b-Matchings
1982 • 421 citations
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
1997 • 417 citations
Recent Advances in Mathematical Programming
1964 • 412 citations
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
1987 • 391 citations
Arc Routing Problems, Part II: The Rural Postman Problem
1995 • 374 citations
Arc Routing Problems, Part I: The Chinese Postman Problem
1995 • 350 citations
Computational experiments with algorithms for a class of routing problems
1983 • 300 citations
The traveling salesman problem on a graph and some related integer polyhedra
1985 • 285 citations
Sequencing of Insertions in Printed Circuit Board Assembly
1988 • 265 citations
A fundamental problem in vehicle routing
1974 • 259 citations
Minimum cuts and related problems
1975 • 250 citations
On general routing problems
1976 • 243 citations
On the symmetric travelling salesman problem I: Inequalities
1979 • 212 citations
On the complexity of edge traversing
1976 • 165 citations
The Capacitated Arc Routing Problem: Lower bounds
1992 • 156 citations
On the structure of all minimum cuts in a network and applications
1982 • 149 citations
Der Saccus endolymphaticus bei Entzündungsprozessen
1944 • 133 citations
Facet identification for the symmetric traveling salesman polytope
1990 • 133 citations
The optimum traversal of a graph
1973 • 119 citations
Untitled
1998 • 114 citations
Improvement Procedures for the Undirected Rural Postman Problem
1999 • 110 citations
A polyhedral approach to the rural postman problem
1994 • 99 citations
A branch-and-cut algorithm for the Undirected Rural Postman Problem
2000 • 98 citations
Algorithms for the rural postman problem
1995 • 94 citations
Approximate solutions for the capacitated arc routing problem
1989 • 93 citations
Solving matching problems with linear programming
1985 • 93 citations
An algorithm for the Rural Postman problem on a directed graph
1986 • 91 citations
A cutting plane procedure for the travelling salesman problem on road networks
1985 • 85 citations
An optimal algorithm for the mixed Chinese postman problem
1996 • 72 citations
A cutting plane algorithm for the windy postman problem
1992 • 57 citations
A cutting plane algorithm for the General Routing Problem
2001 • 54 citations
On the windy postman problem
1984 • 51 citations
Provably good solutions for the traveling salesman problem
1994 • 44 citations
The Chinese Postman Problem
1980 • 44 citations
New inequalities for the General Routing Problem
1997 • 38 citations
The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
1998 • 38 citations
An optimal method for the mixed postman problem
2005 • 38 citations
The rural postman problem with deadline classes
1998 • 37 citations
A cutting plane algorithm for minimum perfect 2-matchings
1987 • 36 citations
The general routing polyhedron: A unifying framework
1999 • 21 citations
Graphentheorie in Planungs- und Tourenproblemen
1970 • 19 citations
Mathematical Programming
2022 • 12 citations