{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:47:45Z","timestamp":1768006065198,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3364,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0166-218x(03)00380-9","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T20:20:14Z","timestamp":1060287614000},"page":"277-294","source":"Crossref","is-referenced-by-count":47,"title":["Strong lower bounds for the prize collecting Steiner problem in graphs"],"prefix":"10.1016","volume":"141","author":[{"given":"Abilio","family":"Lucena","sequence":"first","affiliation":[]},{"given":"Mauricio G.C","family":"Resende","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00380-9_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(03)00380-9_BIB2","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","article-title":"The prize collecting traveling salesman problem","volume":"19","author":"Balas","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00380-9_BIB3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01581256","article-title":"A note on the prize collecting traveling salesman problem","volume":"59","author":"Bienstock","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00380-9_BIB5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","article-title":"Local search with perturbations for the prize collecting Steiner tree problem in graphs","volume":"38","author":"Canuto","year":"2001","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(03)00380-9_BIB6","first-page":"393","article-title":"Solution of a large scale traveling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB7","unstructured":"C. Duin, Steiner's problem in graphs, Ph.D. Thesis, University of Amsterdam (1994)."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","article-title":"Matroids and the greedy algorithm","volume":"1","author":"Edmonds","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00380-9_BIB9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01582064","article-title":"The Steiner tree polytope and related polyhedra","volume":"63","author":"Goemans","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00380-9_BIB10","unstructured":"M. Goemans, D. Williamson, The primal dual method for approximation algorithms and its application to network design problems, in: D. Hochbaum, (Ed.), Approximation Algorithms for NP-Hard Problems, P.W.S. Publishing Co., Boston, MA, USA, 1996, pp. 144\u2013191."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB11","unstructured":"ILOG CPLEX, Inc., Cplex 6.5 (1999)."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB12","unstructured":"D. Johnson, M. Minkoff, S. Phillips, The prize collecting tree problem: theory and practice, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, USA, 1999, pp. 760\u2013769."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB13","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\/S0166-218X(03)00380-9_BIB14","unstructured":"A. Lucena, Tight bounds for the Steiner problem in graphs, talk given at the TIMS XXX\u2014SOBRAPO XXIII Joint International Meeting, Rio de Janeiro, 1991."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB15","unstructured":"A. Lucena, Tight bounds for the Steiner problem in graphs, Technical Report, IRC for Process Systems Engineering, Imperial College, 1993."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB16","series-title":"Advances in Linear and Integer Programming","first-page":"187","article-title":"Branch and cut algorithms","author":"Lucena","year":"1996"},{"key":"10.1016\/S0166-218X(03)00380-9_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01582065","article-title":"Tree polyhedron on 2-tree","volume":"63","author":"Margot","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(03)00380-9_BIB18","first-page":"511","article-title":"Trees and cuts","volume":"17","author":"Padberg","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/opre.21.1.261","article-title":"A graph theoretic equivalence for integer programs","volume":"2","author":"Picard","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(03)00380-9_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230170102","article-title":"The node-weighted Steiner tree problem","volume":"17","author":"Segev","year":"1987","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003809?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003809?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T02:23:04Z","timestamp":1552616584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0166218X03003809"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00380-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}