{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:04Z","timestamp":1725583984007},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_18","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"163-174","source":"Crossref","is-referenced-by-count":1,"title":["A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem"],"prefix":"10.1007","author":[{"given":"Jinghao","family":"Sun","sequence":"first","affiliation":[]},{"given":"Yakun","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Guozhen","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.comnet.2006.08.015","volume":"51","author":"C. Chi","year":"2007","unstructured":"Chi, C., Hao, R.: Test Generation for Interaction Detection in Feature-Rich Communication Systems. Computer Networks\u00a051, 426\u2013438 (2007)","journal-title":"Computer Networks"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-3975(99)00134-6","volume":"254","author":"P.R. Springintveld","year":"2001","unstructured":"Springintveld, P.R., Vaandrager, F.: Testing timed automata. Theoretical Computer Science\u00a0254, 225\u2013257 (2001)","journal-title":"Theoretical Computer Science"},{"key":"18_CR3","first-page":"5263","volume":"15","author":"G.Z. Tan","year":"2012","unstructured":"Tan, G.Z., Sun, J.H., Meng, Y.K.: Solving the Time Dependent Chinese Postman Problem by Branch & Bound Algorithm. Information\u00a015, 5263\u20135270 (2012)","journal-title":"Information"},{"key":"18_CR4","first-page":"833","volume":"8","author":"J.H. Sun","year":"2011","unstructured":"Sun, J.H., Tan, G.Z., Qu, H.L.: Dynamic programming algorithm for the time dependent Chinese Postman Problem. Journal of Information and Computational Science\u00a08, 833\u2013841 (2011)","journal-title":"Journal of Information and Computational Science"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0898-1221(02)00156-6","volume":"44","author":"H.F. Wang","year":"2002","unstructured":"Wang, H.F., Wen, X.P.: Time-Constrained Chinese Postman Problems. Computers and Mathematics with Applications\u00a044, 375\u2013387 (2002)","journal-title":"Computers and Mathematics with Applications"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C. Malandraki","year":"1992","unstructured":"Malandraki, C., Daskin, M.S.: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms. Transportation Science\u00a026, 185\u2013200 (1992)","journal-title":"Transportation Science"},{"key":"18_CR7","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang","year":"2001","unstructured":"Bang, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2001)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"A.V. Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM\u00a036, 873\u2013886 (1989)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:13:41Z","timestamp":1557717221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}