Integer Programming Modeling for Chinese Postman Problems

Abstract

As far as the traditional Chinese Postman Problem(CPP) is concerned,based on the discussions in the undirected and directed graphs respectively,the corresponding integer programming models are proposed,some numerical examples are given to demonstrate the utility of the models.Furthermore,the models are extended to the case with stochastic weights(the corresponding problem is called Stochastic Chinese Postman Problem).Finally,some possible generalizations of the Chinese Postman Problem are discussed briefly.