乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:27:14Z","timestamp":1743334034753,"version":"3.37.3"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1016\/j.dam.2019.03.015","type":"journal-article","created":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T16:39:24Z","timestamp":1554482364000},"page":"4-19","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Insight into the computation of Steiner minimal trees in Euclidean space of general dimension"],"prefix":"10.1016","volume":"308","author":[{"given":"Marcia","family":"Fampa","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2019.03.015_b1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2013.02.011","article-title":"On the low\u2013dimensional Steiner minimum tree problem in hamming metric","volume":"505","author":"Althaus","year":"2013","journal-title":"Theoret. Comput. Sci."},{"year":"1879","series-title":"\u00dceber das k\u00fcrzeste Verbindungssystem zwischen vier Punkten","author":"Bopp","key":"10.1016\/j.dam.2019.03.015_b2"},{"issue":"2","key":"10.1016\/j.dam.2019.03.015_b3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.20279","article-title":"A novel approach to phylogenetic trees: D-dimensional geometric Steiner trees","volume":"53","author":"Brazil","year":"2009","journal-title":"Networks"},{"key":"10.1016\/j.dam.2019.03.015_b4","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1111\/j.1558-5646.1967.tb03411.x","article-title":"Phylogenetic analysis: Models and estimation procedures","volume":"21","author":"Cavalli-Sforza","year":"1967","journal-title":"Evolution"},{"key":"10.1016\/j.dam.2019.03.015_b5","series-title":"Combinatorial Optimization, vol. 17","article-title":"Shortest connectivity \u2013 introduction with applications in phylogeny","author":"Cieslik","year":"2004"},{"key":"10.1016\/j.dam.2019.03.015_b6","doi-asserted-by":"crossref","first-page":"431","DOI":"10.4153\/CMB-1967-041-8","article-title":"On the Steiner problem","volume":"10","author":"Cockayne","year":"1967","journal-title":"Canad. Math. Bull."},{"year":"1941","series-title":"What is Mathematics?","author":"Courant","key":"10.1016\/j.dam.2019.03.015_b7"},{"key":"10.1016\/j.dam.2019.03.015_b8","series-title":"LNCS (SEA 2015), vol. 9125","first-page":"122","article-title":"On a nonconvex MINLP formulation of the Euclidean Steiner tree problems in n-space","author":"D\u2019Ambrosio","year":"2015"},{"key":"10.1016\/j.dam.2019.03.015_b9","article-title":"On a nonconvex MINLP formulation of the Euclidean Steiner tree problems in n-space: Missing proofs","author":"D\u2019Ambrosio","year":"2018","journal-title":"Optim. Lett."},{"issue":"2","key":"10.1016\/j.dam.2019.03.015_b10","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.disopt.2007.08.006","article-title":"An improved algorithm for computing Steiner minimal trees in euclidean d-space","volume":"5","author":"Fampa","year":"2008","journal-title":"Discrete Optim."},{"key":"10.1016\/j.dam.2019.03.015_b11","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1111\/itor.12207","article-title":"An overview of exact algorithms for the Euclidean Steiner tree problem in n-space","volume":"23","author":"Fampa","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.dam.2019.03.015_b12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10589-016-9835-z","article-title":"A specialized branch-and-bound algorithm for the euclidean Steiner tree problem in n-space","volume":"65","author":"Fampa","year":"2016","journal-title":"Comput. Optim. Appl."},{"issue":"2\u20134","key":"10.1016\/j.dam.2019.03.015_b13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/B:NUMA.0000021765.17831.bc","article-title":"Using a conic formulation for finding Steiner minimal trees","volume":"35","author":"Fampa","year":"2004","journal-title":"Numer. Algorithms"},{"key":"10.1016\/j.dam.2019.03.015_b14","series-title":"Presented at the 11th DIMACS Implementation Challenge Workshop","article-title":"Faster exact algorithm for computing Steiner trees in higher dimensional Euclidean spaces","author":"Fonseca","year":"2014"},{"issue":"4","key":"10.1016\/j.dam.2019.03.015_b15","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","article-title":"The complexity of computing Steiner minimal trees","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.dam.2019.03.015_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","article-title":"Steiner minimal trees","volume":"16","author":"Gilbert","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.dam.2019.03.015_b17","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(86)90008-8","article-title":"A linear time algorithm for full Steiner trees","volume":"5","author":"Hwang","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.dam.2019.03.015_b18","unstructured":"F. Hwang, D. Richards, W. Winter, The Steiner tree problem, in: Annals of Discrete Math. Elsevier, vol. 53, Amsterdam, 1992."},{"key":"10.1016\/j.dam.2019.03.015_b19","series-title":"Paths, Flows, and VLSI-Layout","first-page":"185","article-title":"Steiner trees in VLSI-layout","author":"Korte","year":"1990"},{"key":"10.1016\/j.dam.2019.03.015_b20","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/s10898-017-0533-x","article-title":"Virtuous smoothing for global optimization","volume":"69","author":"Lee","year":"2017","journal-title":"J. Global Optim."},{"year":"1990","series-title":"Combinatorial Algorithms for Integrated Circuat Layout","author":"Lengauer","key":"10.1016\/j.dam.2019.03.015_b21"},{"key":"10.1016\/j.dam.2019.03.015_b22","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1018903619285","article-title":"The euclidean Steiner tree problem in Rn: A mathematical programming formulation","volume":"96","author":"Maculan","year":"2000","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.dam.2019.03.015_b23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","article-title":"Pruning by isomorphism in branch-and-cut","volume":"94","author":"Margot","year":"2002","journal-title":"Math. Program."},{"key":"10.1016\/j.dam.2019.03.015_b24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","article-title":"Exploiting orbits in symmetric ilp","volume":"98","author":"Margot","year":"2003","journal-title":"Math. Program. B"},{"key":"10.1016\/j.dam.2019.03.015_b25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","article-title":"On the problem of Steiner","volume":"4","author":"Melzak","year":"1961","journal-title":"Canad. Math. Bull."},{"issue":"1","key":"10.1016\/j.dam.2019.03.015_b26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","article-title":"Orbital branching","volume":"126","author":"Ostrowski","year":"2011","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.dam.2019.03.015_b27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480192241190","article-title":"Steiner trees for terminals constrained to curves","volume":"10","author":"Rubinstein","year":"1997","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20136","key":"10.1016\/j.dam.2019.03.015_b28","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01758756","article-title":"How to find Steiner minimal trees in euclidean d-space","volume":"7","author":"Smith","year":"1992","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.dam.2019.03.015_b29","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1002\/prot.21257","article-title":"Steiner minimal trees, twist angles, and the protein folding problem","volume":"66","author":"Smith","year":"2007","journal-title":"PROTEINS: Struct., Funct., Bioinform."},{"key":"10.1016\/j.dam.2019.03.015_b30","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/ijoc.1040.0101","article-title":"Steiner trees and 3\u2212d macromolecular conformation","volume":"16","author":"Stanton","year":"2004","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.dam.2019.03.015_b31","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1016\/j.comgeo.2011.11.007","article-title":"Geometric conditions for euclidean Steiner trees in Rd","volume":"46","author":"Van\u00a0Laarhoven","year":"2013","journal-title":"Comput. Geom."},{"key":"10.1016\/j.dam.2019.03.015_b32","article-title":"A new exact algorithm for rectilinear Steiner minimal trees","volume":"vol. 22314","author":"Warme","year":"1997"},{"key":"10.1016\/j.dam.2019.03.015_b33","series-title":"Advances in Steiner Trees","first-page":"81","article-title":"Exact algorithms for plane Steiner tree problems: A computational study","author":"Warme","year":"1998"},{"key":"10.1016\/j.dam.2019.03.015_b34","series-title":"Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"979","article-title":"Exact solutions to large-scale plane Steiner tree problems","author":"Warme","year":"1999"},{"key":"10.1016\/j.dam.2019.03.015_b35","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230150305","article-title":"An algorithm for the Steiner problem in the Euclidean plane","volume":"15","author":"Winter","year":"1985","journal-title":"Networks"},{"key":"10.1016\/j.dam.2019.03.015_b36","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L","article-title":"Euclidean Steiner minimum trees: An improved exact algorithm","volume":"30","author":"Winter","year":"1997","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.dam.2019.03.015_b37","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1137\/S1052623495288362","article-title":"An efficient algorithm for minimizing a sum of euclidean norms with applications","volume":"7","author":"Xue","year":"1997","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.dam.2019.03.015_b38","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10107-002-0326-x","article-title":"Rectilinear group Steiner trees and applications in vlsi design","volume":"94","author":"Zachariasen","year":"2003","journal-title":"Math. Program."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X19301787?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X19301787?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T08:25:37Z","timestamp":1640334337000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X19301787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":38,"alternative-id":["S0166218X19301787"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2019.03.015","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2022,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Insight into the computation of Steiner minimal trees in Euclidean space of general dimension","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2019.03.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}