Solving Chinese Postman Problem on Time Varying Network with Timed Automata

DOI10.3724/SP.J.1001.2011.04033zbMath1265.68095OpenAlexW2321478591MaRDI QIDQ2917150

Weihong Yao, Jinghao Sun, Baocai Wang, Guozhen Tan

Publication date: 5 October 2012

Published in: Journal of Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1001.2011.04033

zbMATH Keywords

timed automatatime dependentChinese postman problemtime window

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Formal languages and automata (68Q45) Combinatorial optimization (90C27)

Related Items (1)

Solving the time varying postman problems with timed automata

This page was built for publication: Solving Chinese Postman Problem on Time Varying Network with Timed Automata