{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:44:06Z","timestamp":1778294646205,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0167-6377(03)00026-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T22:33:52Z","timestamp":1051137232000},"page":"15-22","source":"Crossref","is-referenced-by-count":39,"title":["On the directed hop-constrained shortest path problem"],"prefix":"10.1016","volume":"32","author":[{"given":"Geir","family":"Dahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Gouveia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(03)00026-9_BIB1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.4.2.192","article-title":"Using a hop-constrained model to generate alternative communication network design","volume":"4","author":"Balakrishnan","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0167-6377(03)00026-9_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0167-6377(99)00025-5","article-title":"Notes on polyhedra associated with hop-constrained paths","volume":"25","author":"Dahl","year":"1999","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(03)00026-9_BIB3","unstructured":"G. Dahl, L. Gouveia, On the directed hop-constrained shortest path problem, Working Paper 1-2002, Centro de Investiga\u00e7\u00e3o Operacional, Faculdade de Ci\u00eancias da Universidade de Lisboa, 2002."},{"key":"10.1016\/S0167-6377(03)00026-9_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B","article-title":"Curve approximation constrained shortest path problems","volume":"36","author":"Dahl","year":"2000","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(03)00026-9_BIB5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","article-title":"Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints","volume":"10","author":"Gouveia","year":"1998","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0167-6377(03)00026-9_BIB6","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0167-6377(03)00026-9_BIB7","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1998"},{"key":"10.1016\/S0167-6377(03)00026-9_BIB8","unstructured":"J.T. Robacker, Min\u2013max theorems on shortest chains and disjunct cuts of a network, Research Memorandum RM-1660, The Rand Corporation, Santa Monica, 1956."},{"key":"10.1016\/S0167-6377(03)00026-9_BIB9","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000269?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000269?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T01:56:45Z","timestamp":1553219805000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637703000269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0167637703000269"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(03)00026-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}