{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:20:30Z","timestamp":1769689230506,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00247-1","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"150-153","source":"Crossref","is-referenced-by-count":20,"special_numbering":"C","title":["Dual Heuristics on the Exact Solution of Large Steiner Problems"],"prefix":"10.1016","volume":"7","author":[{"given":"Marcus Poggi","family":"de Arag\u00e3o","sequence":"first","affiliation":[]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00247-1_BIB1","author":"Duin","year":"1993","journal-title":"Steiner's problem in graphs, PhD thesis, Univ. of Amsterdam"},{"key":"10.1016\/S1571-0653(04)00247-1_BIB2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","article-title":"Solving Steiner tree problems in graphs to optimality","volume":"32","author":"Koch","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S1571-0653(04)00247-1_BIB3","doi-asserted-by":"crossref","unstructured":"T. Koch, A. Martin, and S. Vofi - SteinLib: An updated library on Steiner tree problems in graphs, ZIB-Report 00-37, Berlin (2000), URL: http:\/\/elib.zib.de\/steinlib.","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"10.1016\/S1571-0653(04)00247-1_BIB4","author":"Ribeiro","year":"2000","journal-title":"A hybrid GRASP with perturbations and adaptive path-relinking for the Steiner Problem in graphs, Proceedings of the Workshop on Algorithm Engineering as a New Paradigm, Kyoto University"},{"key":"10.1016\/S1571-0653(04)00247-1_BIB5","unstructured":"T. Polzin and S. Vahdati - Improved algorithms for the Steiner problem in networks, to appear in Discrete Applied Mathematics."},{"key":"10.1016\/S1571-0653(04)00247-1_BIB6","author":"Uchoa","year":"1999","journal-title":"Preprocessing Steiner problems from VLSI Layout, Report MCC. 32\/99 PUG - Rio de Janeiro"},{"key":"10.1016\/S1571-0653(04)00247-1_BIB7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","article-title":"A dual ascent approach for Steiner tree problems on a directed graph","volume":"28","author":"Wong","year":"1984","journal-title":"Mathematical Programming"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002471?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002471?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T18:53:33Z","timestamp":1586199213000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304002471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":7,"alternative-id":["S1571065304002471"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00247-1","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}