<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=30986"><dc:title>Chinese postman problem with priority nodes</dc:title><dc:creator>Kramberger,	Tomaž	(Avtor)
	</dc:creator><dc:creator>Štrubelj,	Gregor	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>Chinese postman problem</dc:subject><dc:subject>ARP</dc:subject><dc:subject>heuristics</dc:subject><dc:subject>Eulerian graph</dc:subject><dc:description>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.</dc:description><dc:date>2009</dc:date><dc:date>2012-06-05 09:57:10</dc:date><dc:type>Neznano</dc:type><dc:identifier>30986</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>