{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T13:02:08Z","timestamp":1772888528582,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,5,23]],"date-time":"2014-05-23T00:00:00Z","timestamp":1400803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10878-014-9755-8","type":"journal-article","created":{"date-parts":[[2014,5,22]],"date-time":"2014-05-22T05:15:34Z","timestamp":1400735734000},"page":"565-588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["An integer programming approach for the Chinese postman problem with time-dependent travel time"],"prefix":"10.1007","volume":"29","author":[{"given":"Jinghao","family":"Sun","sequence":"first","affiliation":[]},{"given":"Yakun","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Guozhen","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,23]]},"reference":[{"key":"9755_CR1","doi-asserted-by":"crossref","first-page":"1604","DOI":"10.1109\/26.111442","volume":"39","author":"AV Aho","year":"1991","unstructured":"Aho AV, Dahbura AT, Lee D, Uyar MU (1991) An Optimisation technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. IEEE Trans Commun 39:1604\u20131615","journal-title":"IEEE Trans Commun"},{"issue":"12","key":"9755_CR2","doi-asserted-by":"crossref","first-page":"3423","DOI":"10.1016\/j.cor.2005.02.012","volume":"33","author":"UF Aminu","year":"2006","unstructured":"Aminu UF, Eglese RW (2006) A constraint programming approach to the Chinese postman problem with time windows. Comput Oper Res 33(12):3423\u20133431","journal-title":"Comput Oper Res"},{"key":"9755_CR3","volume-title":"Digraphs: theory. Algorithms and applications","author":"J Bang","year":"2001","unstructured":"Bang J, Gutin G (2001) Digraphs: theory. Algorithms and applications. Springer, London"},{"key":"9755_CR4","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.comnet.2006.08.015","volume":"51","author":"C Chi","year":"2007","unstructured":"Chi C, Hao R (2007) Test generation for interaction detection in feature-rich communication systems. Comput Netw 51:426\u2013438","journal-title":"Comput Netw"},{"key":"9755_CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10107-003-0391-9","volume":"96","author":"A Corberan","year":"2003","unstructured":"Corberan A, Romero A, Sanchis JM (2003) The mixed general routing polyhedron. Math Program 96:103\u2013137","journal-title":"Math Program"},{"key":"9755_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.1040.0168","volume":"52","author":"A Corberan","year":"2005","unstructured":"Corberan A, Mejia G, Sanchis JM (2005) New results on the mixed general routing problem. Oper Res 52:363\u2013376","journal-title":"Oper Res"},{"key":"9755_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4495-1","volume-title":"Arc routing: Theory, solutions and applications","author":"M Dror","year":"2000","unstructured":"Dror M (2000) Arc routing: Theory, solutions and applications. Kluwer Academic Publishers, Boston"},{"key":"9755_CR8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds J, Johnson EL (1973) Matching, Euler tours and the Chinese postman. Math Program 5:88\u2013124","journal-title":"Math Program"},{"key":"9755_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(92)00003-5","volume":"48","author":"RW Eglese","year":"1994","unstructured":"Eglese RW (1994) Routing winter gritting vehicles. Discr Appl Math 48:231\u2013244","journal-title":"Discr Appl Math"},{"key":"9755_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt HA, Gendreau M, Laporte G (1995a) Arc routing problems, Part 1: The Chinese postman problem. Oper Res 43:231\u2013242","journal-title":"Oper Res"},{"key":"9755_CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt HA, Gendreau M, Laporte G (1995b) Arc routing problems, Part 2: The Chinese postman problem. Oper Res 43:399\u2013414","journal-title":"Oper Res"},{"key":"9755_CR12","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s101070050007","volume":"87","author":"G Ghiani","year":"2000","unstructured":"Ghiani G, Laporte G (2000) A branch-and-cut algorithm for the undirected rural postman problem. Math Program 87:467\u2013481","journal-title":"Math Program"},{"issue":"4","key":"9755_CR13","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"AV Goldberg","year":"1989","unstructured":"Goldberg AV, Tarjan RE (1989) Finding minimum-cost circulations by canceling negative cycles. J ACM 36(4):873\u2013886","journal-title":"J ACM"},{"key":"9755_CR14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01581206","volume":"55","author":"M Gr\u00f3tschel","year":"1992","unstructured":"Gr\u00f3tschel M, Win Z (1992) A cutting plane algorithm for the windy postman problem. Math Program 55:339\u2013358","journal-title":"Math Program"},{"key":"9755_CR15","first-page":"273","volume":"1","author":"MK Guan","year":"1962","unstructured":"Guan MK (1962) Graphic programming using odd or even points. Chin Math 1:273\u2013277","journal-title":"Chin Math"},{"key":"9755_CR16","doi-asserted-by":"crossref","unstructured":"Hessel A, Larsen KG, Nielsen B, Pettersson P, Skou A(2003) Time-optimal test cases for real-time systems. In: 3rd international workshop on formal approaches to testing of software, Montreal, Quebec, Canada","DOI":"10.1007\/978-3-540-40903-8_19"},{"key":"9755_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0164-1212(01)00132-7","volume":"62","author":"R Lai","year":"2002","unstructured":"Lai R (2002) A survey of communication protocol testing. J Syst Softw 62:21\u201346","journal-title":"J Syst Softw"},{"key":"9755_CR18","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/S0305-0548(97)00013-0","volume":"24","author":"G Laporte","year":"1997","unstructured":"Laporte G (1997) Modeling and solving several classes of arc routing problems as traveling salesman problems. Comput Oper Res 24:1057\u20131061","journal-title":"Comput Oper Res"},{"key":"9755_CR19","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1016\/j.cor.2004.11.020","volume":"33","author":"H Longo","year":"2006","unstructured":"Longo H, Aragao MP, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CVRP. Comput Oper Res 33:1823\u20131837","journal-title":"Comput Oper Res"},{"key":"9755_CR20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C Malandraki","year":"1992","unstructured":"Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations. Properties and Heuristic algorithms. Transp Sci 26:185\u2013200","journal-title":"Transp Sci"},{"key":"9755_CR21","unstructured":"Mullaseril PA (1996) Capacitated rural postman problem with time windows and split delivery. Ph.D Thesis. University of Arizona"},{"key":"9755_CR22","first-page":"95","volume":"27","author":"Y Nober","year":"1996","unstructured":"Nober Y, Picard JC (1996) An optimal algorithm for the mixed Chinese postman problem. Networks 27:95\u2013108","journal-title":"Networks"},{"key":"9755_CR23","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda A, Rom R (1990) Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J ACM 37:607\u2013625","journal-title":"J ACM"},{"key":"9755_CR24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0305-0548(87)90065-7","volume":"14","author":"WL Pearn","year":"1987","unstructured":"Pearn WL, Assad A, Golden BL (1987) Transforming arc routing into node routing problems. Comput Oper Res 14:285\u2013288","journal-title":"Comput Oper Res"},{"key":"9755_CR25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0304-3975(99)00134-6","volume":"254","author":"PR Springintveld","year":"2001","unstructured":"Springintveld PR, Vaandrager F (2001) Testing timed automata. Theor Comput Sci 254:225\u2013257","journal-title":"Theor Comput Sci"},{"key":"9755_CR26","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ejor.2006.06.028","volume":"181","author":"M Tagmouti","year":"2007","unstructured":"Tagmouti M, Gendreau M, Potvin JY (2007) Arc routing problems with time-dependent service costs. Eur J Oper Res 181:30\u201339","journal-title":"Eur J Oper Res"},{"key":"9755_CR27","unstructured":"Tan GZ, Sun JH (2011) An integer programming approach for the rural postman problem with time dependent travel time, In: 17th Annual international computing and combinatorics conference (COCOON 2011), LNCS. 6842, pp 414\u2013431"},{"key":"9755_CR28","doi-asserted-by":"crossref","unstructured":"Tan GZ, Sun JH, Hou GJ (2012) Time dependent rural postman problem: polyhedral results. Optim Methods Softw. doi: 10.1080\/10556788.2012.666240","DOI":"10.1080\/10556788.2012.666240"},{"key":"9755_CR29","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0898-1221(02)00156-6","volume":"44","author":"HF Wang","year":"2002","unstructured":"Wang HF, Wen XP (2002) Time-constrained Chinese postman problems. Comput Math Appl 44:375\u2013387","journal-title":"Comput Math Appl"},{"key":"9755_CR30","doi-asserted-by":"crossref","unstructured":"Yannakakis M (2004) Testing, optimization, and games. In: Proceedings of the Nineteenth Annual IEEE Symposium on Logic In Computer Science. LICS. pp 78\u201388","DOI":"10.1109\/LICS.2004.1319602"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9755-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9755-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9755-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:15:26Z","timestamp":1649031326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9755-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,23]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9755"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9755-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,23]]}}}