ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Chinese postman problem with priority nodes
    Kramberger, Tomaž ; Štrubelj, Gregor ; Žerovnik, Janez, 1958-
    A generalization of the Chinese Postman Problem is studied in which the delays at a subset of priority nodes are penalized in the cost function. As it is shown that the problem is NP-hard, two tour ... constructing heuristics are proposed, and their properties are studied. It is proved that one of the heuristics gives optimal solutions on a subset of instances with bounded cost of delays. The implementations of the heuristics are compared on several types of randomly generated instances.
    Source: Foundations of Computing and Decision Sciences. - ISSN 0867-6356 (Vol. 34, no. 4, 2009, str. 233-264)
    Type of material - article, component part
    Publish date - 2009
    Language - english
    COBISS.SI-ID - 512171325