Back to search

Arc Routing Problems, Part I: The Chinese Postman Problem

Data up to Jan 2025

Published1995
Citations350
References63

Total Citations Per Year

Abstract

References (63)

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

Graph theory

1969 • 11,244 citations

Flows in networks

1962 • 4,199 citations

Combinatorial optimization: networks and matroids

2021 • 3,410 citations

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

1986 • 1,777 citations

P-Complete Approximation Problems

1976 • 1,701 citations

Paths, Trees, and Flowers

2009 • 1,627 citations

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

1991 • 1,056 citations

ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART

1983 • 1,004 citations

Matching, Euler tours and the Chinese postman

1973 • 979 citations

Routing and scheduling of vehicles and crews

1983 • 849 citations

Urban operations research

1982 • 731 citations

Networks and vehicle routing for municipal waste collection

1974 • 475 citations

Optimization Algorithms for Networks and Graphs.

1994 • 430 citations

Approximation Algorithms for Some Routing Problems

1978 • 427 citations

Odd Minimum Cut-Sets and b-Matchings

1982 • 421 citations

Analysis of flow in networks of conduits or conductors

1936 • 339 citations

Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren

1873 • 277 citations

Solution of large-scale symmetric travelling salesman problems

1991 • 275 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

Eulerian Graphs and Related Topics

1991 • 226 citations

Graph theory: An algorithmic approach (Computer science and applied mathematics)

1975 • 182 citations

Approximation Algorithms for Some Postman Problems

1979 • 180 citations

On the complexity of edge traversing

1976 • 165 citations

Morphology of ground states of two-dimensional frustration model

1982 • 152 citations

On the structure of all minimum cuts in a network and applications

1982 • 149 citations

An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

1986 • 130 citations

The optimum traversal of a graph

1973 • 119 citations

Leonhard Euler and the Koenigsberg Bridges

1953 • 113 citations

A Computer-Assisted System for the Routing and Scheduling of Street Sweepers

1978 • 97 citations

Circuits and Trees in Oriented Linear Graphs

2009 • 90 citations

The Chinese Postman Problem for Mixed Networks

1979 • 90 citations

Graphs, Dynamic Programming, and Finite Games

1968 • 83 citations

Pierce point minimization and optimal torch path determination in flame cutting

1984 • 68 citations

Postman tour on a graph with precedence relation on arcs

1987 • 68 citations

Covering a graph by circuits

1978 • 65 citations

A cutting plane algorithm for the windy postman problem

1992 • 57 citations

On the Windy Postman Problem on eulerian graphs

1989 • 53 citations

Covering Graphs by Simple Circuits

1981 • 53 citations

On the windy postman problem

1984 • 51 citations

On the Relation Between the Traveling-Salesman and the Longest-Path Problems

1962 • 46 citations

Solving (large scale) matching problems combinatorially

1991 • 46 citations

APPLICATION OF ROUTING TECHNOLOGIES TO RURAL SNOW AND ICE CONTROL

1991 • 42 citations

Solving large-scale matching problems

1993 • 41 citations

The snow ploughing problem solved by a graph theory algorithm

1984 • 38 citations

An optimal method for the mixed postman problem

2005 • 38 citations

A new algorithm for the directed chinese postman problem

1988 • 35 citations

Public sector vehicle routing : the Chinese postman problem.

1970 • 26 citations

The chinese postman problem for mixed graphs

1981 • 26 citations

The mixed postman problem

1979 • 23 citations

POSTMAN ROUTING PROBLEM IN A HIERARCHICAL NETWORK

1988 • 22 citations

Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph

1981 • 22 citations

Graphentheorie in Planungs- und Tourenproblemen

1970 • 19 citations

Topological testing

2003 • 11 citations

Eulerian Orientations and Circulations

1985 • 11 citations

Problemas de rutas por arcos

1983 • 9 citations

An improvement of Orloff's general routing problem

1977 • 9 citations

Covering the edges of a graph by circuits

1988 • 8 citations

A cubic algorithm for the directed Eulerian subgraph problem

1991 • 5 citations

AN OPTIMAL ALGORITHM FOR THE MIXED CHINESE POSTMAN PROBLEM

1991 • 5 citations

THE WINDY POSTMAN PROBLEM ON GENERAL GRAPHS

1990 • 4 citations

Cited By (0)

Loading...