{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:18:49Z","timestamp":1648531129563},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T00:00:00Z","timestamp":1495497600000},"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":["J Syst Sci Complex"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11424-017-6138-0","type":"journal-article","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T05:44:23Z","timestamp":1495518263000},"page":"527-538","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Andrew","family":"Ensor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felipe","family":"Lillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"issue":"1","key":"6138_CR1","doi-asserted-by":"publisher","first-page":"16500005","DOI":"10.1142\/S0217595916500056","volume":"33","author":"A Ensor","year":"2016","unstructured":"Ensor A and Lillo F, Colored-edge graph approach for the modeling of multimodal transportation systems, Asia-Pacific Journal of Operational Research, 2016, 33(1): 16500005.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"2","key":"6138_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ejor.2009.10.013","volume":"204","author":"J Cl\u00edmaco","year":"2010","unstructured":"Cl\u00edmaco J, Captivo M, and Pascoal M, On the bicriterion-minimal cost\/minimal label-spanning tree problem, European Journal of Operational Research, 2010, 204(2): 199\u2013205.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6138_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.amc.2009.04.086","volume":"215","author":"H Y Xu","year":"2009","unstructured":"Xu H Y, Li K W, Kilgour D M, et al., A matrix-based approach to searching colored paths in a weighted colored multidigraph, Applied Mathematics and Computation, 2009, 215(1): 353\u2013366.","journal-title":"Applied Mathematics and Computation"},{"issue":"2\u20133","key":"6138_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(94)00091-Q","volume":"56","author":"Y Manoussakis","year":"1995","unstructured":"Manoussakis Y, Alternating paths in edge-colored complete graphs, Discrete Applied Mathematics, 1995, 56(2\u20133): 297\u2013309.","journal-title":"Discrete Applied Mathematics"},{"key":"6138_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0012-365X(96)00160-4","volume":"165\u2013166","author":"J Bang-Jensen","year":"1997","unstructured":"Bang-Jensen J and Gutin G, Alternating cycles and paths in edge-coloured multigraphs: A survey, Discrete Mathematics, 1997, 165\u2013166: 39\u201360.","journal-title":"Discrete Mathematics"},{"key":"6138_CR6","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/11496915_21","volume-title":"Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO)","author":"H R\u00f6glin","year":"2005","unstructured":"R\u00f6glin H and V\u00f6cking B, Smoothed analysis of integer programming, Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 2005, 276\u2013290."},{"key":"6138_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-72792-7_5","volume-title":"Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science","author":"R Beier","year":"2007","unstructured":"Beier R, R\u00f6glin H, and V\u00f6cking B, The smoothed number of pareto optimal solutions in bicriteria integer optimization, eds. by Fischetti M and Williamson D, Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Springer Berlin \/ Heidelberg, 2007, 53\u201367."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-017-6138-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-017-6138-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-017-6138-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T09:11:42Z","timestamp":1527585102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-017-6138-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,23]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["6138"],"URL":"https:\/\/doi.org\/10.1007\/s11424-017-6138-0","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,23]]}}}