Jinghao Sun, Yakun Meng, Guozhen Tan. A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem. In Michael R. Fellows, Xuehou Tan, Binhai Zhu, editors, and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings. Volume 7924 of Lecture Notes in Computer Science, pages 163-174, Springer, 2013. [doi]
@inproceedings{SunMT13,
title = {A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem},
author = {Jinghao Sun and Yakun Meng and Guozhen Tan},
year = {2013},
doi = {10.1007/978-3-642-38756-2_18},
url = {http://dx.doi.org/10.1007/978-3-642-38756-2_18},
researchr = {https://researchr.org/publication/SunMT13},
cites = {0},
citedby = {0},
pages = {163-174},
booktitle = {and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings},
editor = {Michael R. Fellows and Xuehou Tan and Binhai Zhu},
volume = {7924},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-38756-2},
}