{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:44:07Z","timestamp":1778294647008,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"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":[[1999,9]]},"DOI":"10.1016\/s0167-6377(99)00025-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"97-100","source":"Crossref","is-referenced-by-count":25,"title":["Notes on polyhedra associated with hop-constrained paths"],"prefix":"10.1016","volume":"25","author":[{"given":"Geir","family":"Dahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00025-5_BIB1","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993."},{"key":"10.1016\/S0167-6377(99)00025-5_BIB2","doi-asserted-by":"crossref","unstructured":"C.R. Coullard, B.A. Gamble, J. Liu, The k-walk polyhedron, in: Du, Ding-Zhu et al. (Eds.), Advances in Optimization and Approximation, Nonconvex Optim. Appl., vol. 1, Kluwer Academic Publishers, Dordrecht, 1994, p. 9\u201329.","DOI":"10.1007\/978-1-4613-3629-7_2"},{"key":"10.1016\/S0167-6377(99)00025-5_BIB3","unstructured":"L. Gouveia, Using variable redefinition for computing minimum spanning and Steiner trees with hop constraints. Faculdade de Ci\u00e9ncias da Universidade de Lisboa, Centro de investiga\u00e7\u00e3o operacional, Lisboa, Portugal. Report 2, 1996."},{"key":"10.1016\/S0167-6377(99)00025-5_BIB4","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"10.1016\/S0167-6377(99)00025-5_BIB5","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976."},{"key":"10.1016\/S0167-6377(99)00025-5_BIB6","doi-asserted-by":"crossref","unstructured":"G. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.","DOI":"10.1002\/9781118627372"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:55:14Z","timestamp":1555577714000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0167637799000255"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00025-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}