{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T11:40:29Z","timestamp":1705664429144},"reference-count":12,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1051\/ro:2001120","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T03:44:25Z","timestamp":1069213465000},"page":"383-394","source":"Crossref","is-referenced-by-count":3,"title":["A New Relaxation in Conic Form for the Euclidean Steiner Problem in \u211c"],"prefix":"10.1051","volume":"35","author":[{"given":"Marcia","family":"Fampa","sequence":"first","affiliation":[]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"Alizadeh","year":"1995","journal-title":"SIAM J. Optim."},{"key":"R2","first-page":"323","volume":"16","author":"Gilbert","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"R3","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"6","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"R4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(86)90008-8","volume":"4","author":"Hwang","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"R5","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/0196-6774(92)90050-M","volume":"13","author":"Hwang","year":"1992","journal-title":"J. Algorithms"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"F.K. Hwang, D.S. Richards and P. Winter, The Steiner Tree Problem.Ann. Discrete Math.53(1992).","DOI":"10.1002\/net.3230220105"},{"key":"R7","unstructured":"C. Lemar\u00e9chal and F. Oustry,Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization. Rapport de recherche, Institut National de Recherche en Informatique et en Automatique, INRIA (1999)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1018903619285","volume":"96","author":"Maculan","year":"2000","journal-title":"Ann. Oper. Res."},{"key":"R9","unstructured":"Y.E. Nesterov and M.J. Todd,Self-Scaled Barriers and Interior-Point Methods for Convex Programming(manuscript)."},{"key":"R10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"Poljak","year":"1995","journal-title":"J. Global Optim."},{"key":"R11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01758756","volume":"7","author":"Smith","year":"1992","journal-title":"Algorithmica"},{"key":"R12","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1137\/S1052623495288362","volume":"7","author":"Xue","year":"1997","journal-title":"SIAM J. Optim."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001120\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T06:44:21Z","timestamp":1521873861000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":12,"journal-issue":{"issue":"4"},"alternative-id":["ro20114"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001120","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}
