A New Integer Programming Formulation for the Chinese Postman Problem with Time Dependent Travel Times

Abstract

The Chinese Postman Problem (CPP) is one of the classical problems in graph theory and is applicable in a wide range of fields. With the rapid development of hybrid systems and model based testing, Chinese Postman Problem with Time Dependent Travel Times (CPPTDT) becomes more realistic than the classical problems. In the literature, we have proposed the… (More)

Topics

  • Presentations referencing similar topics