ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Priority constrained Chinese postman problem [Elektronski vir]
    Kramberger, Tomaž ; Žerovnik, Janez, 1958-
    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 considere dusing 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.
    Source: Logistics & sustainable transport [Elektronski vir]. - ISSN 2232-4968 (Vol. 1, no 1, 22-05-07, 15 str.)
    Type of material - e-article
    Publish date - 2007
    Language - english
    COBISS.SI-ID - 11654934

    Link(s):

    http://www.jlst.org/uploads/priority_constrained_chinese_postman_kramb.zer.pdf

Shelf entry