| C: | 管梅谷 |
| P: | Guǎn Méigǔ |
| W: | Kuan Mei-ku |
| Myr: | Gwan Mei-gu |
Meigu Guan (also Romanized as Mei-Ko Kwan or Mei-ku Kuan, born 1934 in Shanghai) is a Chinese mathematician and one of the country's leading experts on mathematical programming. He is known for his research on the route inspection problem, and served as president of Shandong Normal University.
Guan is known for formulating the route inspection problem. 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. Its applications include transportation planning problems such as planning routes for a fleet of snowplows to plow all the streets of a city, in minimum total time.[1]
Guan worked as a lecturer at Shandong Normal University during the Great Leap Forward of 1958–1960, during which Chinese mathematicians were encouraged to work on practical problems. He published his work on the route inspection problem in 1960, and his paper was translated into English in 1962. It attracted the attention of Jack Edmonds, who gave the problem its alternative name, the "Chinese postman problem", in honor of Guan,[2] and proved that this problem can be solved optimally in polynomial time.
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.
Guan finished his studies in 1957 at the East China Normal University in Shanghai, and in the same year joined the faculty at Shandong Normal University.[3] He served as president of Shandong Normal University from 1984 to 1990. 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.[4]