{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:14:57Z","timestamp":1773324897065,"version":"3.50.1"},"reference-count":5,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"},{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"ARC Linkage Grant","award":["Grant LP0883855"],"award-info":[{"award-number":["Grant LP0883855"]}]},{"name":"The University of Newcastle, Faculty of Science and IT Strategic Small Grant 2011"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["NETWORKS"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1002\/net.21541","type":"journal-article","created":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T07:20:46Z","timestamp":1394608846000},"page":"239-242","source":"Crossref","is-referenced-by-count":4,"title":["A note on shortest path problems with forbidden paths"],"prefix":"10.1002","volume":"63","author":[{"given":"Olivia J.","family":"Smith","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics; University of Melbourne; Victoria Australia"}]},{"given":"Martin W.P.","family":"Savelsbergh","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics; University of Melbourne; Victoria Australia"}]}],"member":"311","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"10.1002\/net.21541-BIB0001|net21541-cit-0001","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching - aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Commun ACM"},{"key":"10.1002\/net.21541-BIB0002|net21541-cit-0002","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","article-title":"An algorithm for the ranking of shortest paths","volume":"69","author":"Azevedo","year":"1993","journal-title":"Eur J Oper Res"},{"key":"10.1002\/net.21541-BIB0003|net21541-cit-0003","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"\u201cColumn Generation,\u201d Chapter 2: Shortest Path Problems with Resource Constraints","author":"Irnich","year":"2005"},{"key":"10.1002\/net.21541-BIB0004|net21541-cit-0004","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/10556788.2011.630077","article-title":"Dynamic programming approaches to solve the shortest path problem with forbidden paths","volume":"28","author":"Pugliese","year":"2013","journal-title":"Optim Methods Software"},{"key":"10.1002\/net.21541-BIB0005|net21541-cit-0005","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.ejor.2004.01.032","article-title":"The shortest path problem with forbidden paths","volume":"165","author":"Villeneuve","year":"2005","journal-title":"Eur J Oper Res"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21541","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21541","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/onlinelibrary.wiley.com\/wol1\/doi\/10.1002\/net.21541\/fullpdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T14:40:44Z","timestamp":1593528044000},"score":1,"resource":{"primary":{"URL":"http:\/\/doi.wiley.com\/10.1002\/net.21541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,12]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"URL":"https:\/\/doi.org\/10.1002\/net.21541","archive":["Portico"],"relation":{},"ISSN":["0028-3045"],"issn-type":[{"value":"0028-3045","type":"print"}],"subject":[],"published":{"date-parts":[[2014,3,12]]}}}