| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme


1 - 1 / 1
First pagePrevious page1Next pageLast page
Chinese postman problem with priority nodes
Tomaž Kramberger, Gregor Štrubelj, Janez Žerovnik, 2009, original scientific article

Abstract: 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.
Keywords: Chinese postman problem, ARP, heuristics, Eulerian graph
Published in DKUM: 05.06.2012; Views: 13757; Downloads: 45
URL Link to full text

Search done in 0.04 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica