{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:42:30Z","timestamp":1781077350642,"version":"3.54.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":[[1998,8]]},"DOI":"10.1016\/s0167-6377(98)00029-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:03:44Z","timestamp":1027641824000},"page":"21-26","source":"Crossref","is-referenced-by-count":28,"title":["The 2-hop spanning tree problem"],"prefix":"10.1016","volume":"23","author":[{"given":"Geir","family":"Dahl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00029-7_BIB1","unstructured":"T.S. Arthanari, Y. Dodge, Mathematical Programming in Statistics, Wiley, New York, 1986."},{"key":"10.1016\/S0167-6377(98)00029-7_BIB2","unstructured":"G. Dahl, Stable set polytopes for a class of circulant graphs, University of Oslo, Institute of Informatics, Report 249, May 1997 (to appear in SIAM Optimization)."},{"key":"10.1016\/S0167-6377(98)00029-7_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(98)00029-7_BIB4","doi-asserted-by":"crossref","unstructured":"T.L. Magnanti, L.A. Wolsey, Optimal trees, in: Ball et al. (Eds.), Network Optimization, Handbooks in Operations Research and Management Science, vol. 7, North-Holland, Amsterdam, 1995, pp. 503\u2013615.","DOI":"10.1016\/S0927-0507(05)80126-4"},{"key":"10.1016\/S0167-6377(98)00029-7_BIB5","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:S0167637798000297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T05:40:11Z","timestamp":1580362811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0167637798000297"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00029-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}