Meigu Guan

[1] He is known for his research on the route inspection problem, and served as president of Shandong Normal University.

[1] This problem is a generalization of the Euler tour problem, in which the input is an edge-weighted graph and the goal is to find a closed walk of minimum total weight that visits every graph edge at least once.

He published his work on the route inspection problem in 1960, and his paper was translated into English in 1962.

[1] One of Guan's later contributions was to prove that, in contrast, the windy postman problem is NP-complete; this is a generalized version of the route inspection problem in which the cost of traversing an edge depends on the direction in which it is traversed.

He then became director of the department of operations research at Fudan University from 1990 to 1995, after which he moved to the business school of the Royal Melbourne Institute of Technology in Australia.

An instance of Guan's route inspection problem (black edges and weights) and its optimal solution (doubling the red edges to produce an Eulerian multigraph )