{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:28:54Z","timestamp":1773523734807,"version":"3.50.1"},"reference-count":5,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8533,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Certain properties of a shortest chain subject to several side constraints are established. Based on these an implicit enumeration algorithm, that is, a generalization of the one given by Dijkstra for the case without any side constraint, is presented. Validation of the algorithm and an illustrative example are included.<\/jats:p>","DOI":"10.1002\/net.3230130212","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T15:17:52Z","timestamp":1178896672000},"page":"295-302","source":"Crossref","is-referenced-by-count":105,"title":["Shortest chain subject to side constraints"],"prefix":"10.1002","volume":"13","author":[{"given":"Y. P.","family":"Aneja","sequence":"first","affiliation":[]},{"given":"V.","family":"Aggarwal","sequence":"additional","affiliation":[]},{"given":"K. P. K.","family":"Nair","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800250314"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_5_2","volume-title":"Principles of Operations Research","author":"Wagner H. M.","year":"1969"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-80808-1"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130212","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T09:16:23Z","timestamp":1697793383000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["10.1002\/net.3230130212"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130212","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}