Priority constrained Chinese postman problem
Tomaž Kramberger and Janez Žerovnik
Logistics and sustainable transport Volume 1, Number 1, 2007. ISSN 1854-3332

Abstract

In early ninety sixties of the last century the Chinese mathematician Mei-Ko Kwan (M. Guan) proposed a method that could be used to minimize the lengths of routes walked by mail carriers. In several papers this problem is considered using different formulations (there are at least 16 different formulations of CPP problems). Motivated by a practical problem we proposed another formulation of the problem called Priority Constrained Chinese Postman Problem (PCCPP), in which a linear order on a set of important nodes is given and the task is to traverse all edges at least once in such a way that the higher priority nodes are visited as soon as possible.

[Edit]