{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:14:00Z","timestamp":1743092040449,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539812"},{"type":"electronic","value":"9783319539829"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53982-9_11","type":"book-chapter","created":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T10:14:02Z","timestamp":1487067242000},"page":"180-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comparison of One-Pass and Bi-directional Approaches Applied to Large-Scale Road Inspection"],"prefix":"10.1007","author":[{"given":"Yujie","family":"Chen","sequence":"first","affiliation":[]},{"given":"Fiona","family":"Polack","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Cowling","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Remde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,15]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/15427951.2010.557277","volume":"6","author":"J Blitzstein","year":"2011","unstructured":"Blitzstein, J., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6(4), 489\u2013522 (2011)","journal-title":"Internet Math."},{"key":"11_CR2","unstructured":"Chartrand, G., Oellermann, O.: Graph minors. In: Applied and Algorithmic Graph Theory, pp. 277\u2013281. McGraw-Hill (1993)"},{"key":"11_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group (1976)"},{"key":"11_CR4","unstructured":"Department for Transport: Well-maintained Highways: Code of Practice for Highway Maintenance Management (2005)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17(3), 449\u2013467 (1965). \n                    http:\/\/www.cs.princeton.edu\/introcs\/papers\/edmonds.pdf","journal-title":"Can. J. Math."},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, euler tours and the chinese postman. Math. Program. 5(1), 88\u2013124 (1973). \n                    http:\/\/link.springer.com\/article\/10.1007\/BF01580113","journal-title":"Math. Program."},{"key":"11_CR8","unstructured":"Even, S.: Paths in graphs. In: Even, G. (ed.) Graph Algorithms, pp. 1\u201328. Cambridge University Press, Cambridge (2011). \n                    http:\/\/xueshu.baidu.com\/s?wd=paperuri%3A%287ed99be525cb1711f144757e32844ef9%29&filter=sc_long_sign&tn=SE_xueshusource_2kduw22v&sc_vurl=http%3A%2F%2Fdl.acm.org%2Fcitation.cfm%3Fid%3D2049721&ie=utf-8&sc_us=9448669111505408634"},{"issue":"2","key":"11_CR9","first-page":"257","volume":"2","author":"M Fleury","year":"1883","unstructured":"Fleury, M.: Deux problemes de geometrie de situation. J. Math. Elementaires 2(2), 257\u2013261 (1883)","journal-title":"J. Math. Elementaires"},{"issue":"6","key":"11_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987). \n                    http:\/\/dl.acm.org\/citation.cfm?id=28874","journal-title":"J. ACM"},{"key":"11_CR12","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434\u2013443. Society for Industrial and Applied Mathematics (1990). \n                    http:\/\/dl.acm.org\/citation.cfm?id=320229"},{"issue":"110","key":"11_CR13","first-page":"273","volume":"1","author":"M Guan","year":"1962","unstructured":"Guan, M.: Graphic programming using odd or even points. Chin. Math. 1(110), 273\u2013277 (1962)","journal-title":"Chin. Math."},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C Hierholzer","year":"1873","unstructured":"Hierholzer, C., Wiener, C.: Ueber die M\u00f6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Math. Ann. 6(1), 30\u201332 (1873). \n                    http:\/\/dx.doi.org\/10.1007\/BF01442866\n                    \n                  , \n                    http:\/\/www.springerlink.com\/index\/X4458623778T4704.pdf","journal-title":"Math. Ann."},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ejor.2007.06.002","volume":"190","author":"S Irnich","year":"2008","unstructured":"Irnich, S.: Solution of real-world postman problems. Eur. J. Oper. Res. 190(1), 52\u201367 (2008). \n                    http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221707005486","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"6323","DOI":"10.1016\/j.sbspro.2010.04.041","volume":"2","author":"MK Jha","year":"2010","unstructured":"Jha, M.K., Udenta, F., Chacha, S., Abdullah, J.: Formulation and solution algorithms for highway infrastructure maintenance optimisation with work-shift and overtime limit constraints. Procedia Soc. Behav. Sci. 2(3), 6323\u20136331 (2010). \n                    http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877042810010943","journal-title":"Procedia Soc. Behav. Sci."},{"key":"11_CR17","unstructured":"Jha, M.K., Udenta, F., Chacha, S., Karri, G.: A modified arc routing problem for highway feature inspection considering work-shift and overtime limit constraints. New Aspects of Urban Planning and Transportation, pp. 105\u2013109 (2008), \n                    http:\/\/w3.ualg.pt\/~tpanago\/public\/urban-planning-and-transportation.pdf#page=108"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ijpvp.2006.02.007","volume":"83","author":"M Kallen","year":"2006","unstructured":"Kallen, M., Van Noortwijk, J.: Optimal periodic inspection of a deterioration process with sequential condition states. Int. J. Press. Vessels Pip. 83(4), 249\u2013255 (2006). \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0308016106000251","journal-title":"Int. J. Press. Vessels Pip."},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s12532-009-0002-8","volume":"1","author":"V Kolmogorov","year":"2009","unstructured":"Kolmogorov, V.: Blossom V: a new implementation of a minimum cost perfect matching algorithm. Math. Program. Comput. 1(1), 43\u201367 (2009). \n                    http:\/\/link.springer.com\/10.1007\/s12532-009-0002-8","journal-title":"Math. Program. Comput."},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/321138.321140","volume":"9","author":"JM Kurtzberg","year":"1962","unstructured":"Kurtzberg, J.M.: On approximation methods for the assignment problem. J. ACM (JACM) 9(4), 419\u2013439 (1962). \n                    http:\/\/dl.acm.org\/citation.cfm?id=321140","journal-title":"J. ACM (JACM)"},{"issue":"11","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/S0305-0548(97)00013-0","volume":"24","author":"G Laporte","year":"1997","unstructured":"Laporte, G.: Modeling and solving several classes of arc routing problems as traveling salesman problems. Comput. Oper. Res. 24(11), 1057\u20131061 (1997). \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054897000130","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1090\/S0273-0979-05-01088-8","volume":"43","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L.: Graph minor theory. Bull. Am. Math. Soc. 43(1), 75\u201386 (2006). \n                    http:\/\/www.ams.org\/bull\/2006-43-01\/S0273-0979-05-01088-8\/","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1287\/trsc.28.1.55","volume":"28","author":"S Madanat","year":"1994","unstructured":"Madanat, S., Ben-Akiva, M.: Optimal inspection and repair policies for infrastructure facilities. Transp. Sci. 28(1), 55\u201362 (1994). \n                    http:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/trsc.28.1.55","journal-title":"Transp. Sci."},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.3141\/1991-03","volume":"1991","author":"A Maji","year":"2007","unstructured":"Maji, A., Jha, M.: Modeling highway infrastructure maintenance schedules with budget constraints. Transp. Res. Rec. J. Transp. Res. Board 1991(1), 19\u201326 (2007). \n                    http:\/\/trb.metapress.com\/index\/6U27625743810286.pdf","journal-title":"Transp. Res. Rec. J. Transp. Res. Board"},{"key":"11_CR25","unstructured":"Murphy, A.: Road Lengths in Great Britain: 2013 (2014)"},{"issue":"4","key":"11_CR26","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0210050","volume":"10","author":"EM Reingold","year":"1981","unstructured":"Reingold, E.M., Tarjan, R.E.: On a greedy heuristic for complete matching. SIAM J. Comput. 10(4), 676\u2013681 (1981). \n                    http:\/\/epubs.siam.org\/doi\/abs\/10.1137\/0210050","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR27","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1111\/0885-9507.00166","volume":"15","author":"K Smilowitz","year":"2000","unstructured":"Smilowitz, K., Madanat, S.: Optimal inspection and maintenance policies for infrastructure networks. Comput. Aided Civ. Infrastruct. Eng. 15(1), 5\u201313 (2000). \n                    http:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/0885-9507.00166\/abstract","journal-title":"Comput. Aided Civ. Infrastruct. Eng."},{"key":"11_CR28","unstructured":"Solomonik, E., Bulu\u00e7, A., Demmel, J.: Minimizing communication in all-pairs shortest paths. In: 2013 IEEE 27th International Symposium on Parallel & Distributed Processing (IPDPS), pp. 548\u2013559. IEEE (2013). \n                    http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=6569841"},{"issue":"11","key":"11_CR29","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1002\/spe.540","volume":"33","author":"H Thimbleby","year":"2003","unstructured":"Thimbleby, H.: The directed chinese postman problem. Softw. Pract. Experience 33(11), 1081\u20131096 (2003). \n                    http:\/\/doi.wiley.com\/10.1002\/spe.540","journal-title":"Softw. Pract. Experience"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53982-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T08:45:12Z","timestamp":1558514712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53982-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539812","9783319539829"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53982-9_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"15 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICORES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research and Enterprise Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 February 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icores2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icores.org\/?y=2016","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}