{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:28:03Z","timestamp":1757626083594,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7259,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0166-218x(93)90010-l","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:28:29Z","timestamp":1027639709000},"page":"205-220","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Heuristics for the minimum rectilinear Steiner tree problem: new algorithms and a computational study"],"prefix":"10.1016","volume":"45","author":[{"given":"Cid Carvalho","family":"De Souza","sequence":"first","affiliation":[]},{"given":"Celso Carneiro","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90010-L_BIB1","series-title":"Res. Rept.","article-title":"A heuristic for Euclidean and rectilinear Steiner problems","author":"Beasley","year":"1989"},{"key":"10.1016\/0166-218X(93)90010-L_BIB2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01762114","article-title":"Two probabilistic results on rectilinear Steiner trees","volume":"3","author":"Bern","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(93)90010-L_BIB3","series-title":"Rept. No. UCB\/CSD 87\/306","article-title":"A greedy heuristic for the rectilinear Steiner tree problem","author":"Bern","year":"1986"},{"key":"10.1016\/0166-218X(93)90010-L_BIB4","series-title":"M.Sc. Dissertation","article-title":"O problema de Steiner na m\u00e9trica retil\u00ednea: propriedades, novas heur\u00edsticas e estudo computacional","author":"De Souza","year":"1989"},{"key":"10.1016\/0166-218X(93)90010-L_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01784988","article-title":"A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem","volume":"12","author":"De Souza","year":"1990","journal-title":"OR Spektrum"},{"key":"10.1016\/0166-218X(93)90010-L_BIB6","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(93)90010-L_BIB7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","article-title":"On Steiner's problem with rectilinear distance","volume":"14","author":"Hanan","year":"1966","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(93)90010-L_BIB8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","article-title":"On Steiner minimal trees with rectilinear distance","volume":"30","author":"Hwang","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(93)90010-L_BIB9","first-page":"303","article-title":"The rectilinear Steiner problem","volume":"2","author":"Hwang","year":"1978","journal-title":"J. Fault Tolerant Comput."},{"key":"10.1016\/0166-218X(93)90010-L_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TCS.1979.1084551","article-title":"An O(n log n) algorithm for suboptimal rectilinear Steiner trees","volume":"26","author":"Hwang","year":"1979","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0166-218X(93)90010-L_BIB11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/net.3230150403","article-title":"Probabilistic partitioning algorithms for the rectilinear Steiner problem","volume":"15","author":"Koml\u00f3s","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90010-L_BIB12","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1109\/TCS.1976.1084243","article-title":"Use of Steiner's problem in suboptimal routing in rectilinear metric","volume":"28","author":"Lee","year":"1976","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0166-218X(93)90010-L_BIB13","series-title":"Surveys in Combinatorial Optimization","first-page":"185","article-title":"The Steiner problem in graphs","author":"Maculan","year":"1987"},{"year":"1985","series-title":"Computational Geometry","author":"Preparata","key":"10.1016\/0166-218X(93)90010-L_BIB14"},{"key":"10.1016\/0166-218X(93)90010-L_BIB15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01553886","article-title":"Fast heuristic algorithms for rectilinear Steiner trees","volume":"4","author":"Richards","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(93)90010-L_BIB16","first-page":"21","article-title":"Heuristic algorithms for rectilinear Steiner trees","volume":"7","author":"Servit","year":"1981","journal-title":"Digital Processes"},{"key":"10.1016\/0166-218X(93)90010-L_BIB17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1080\/03052158008902421","article-title":"An O(n log n) heuristic algorithm for the rectilinear Steiner minimal tree problem","volume":"4","author":"Smith","year":"1980","journal-title":"Engrg. Optim."},{"key":"10.1016\/0166-218X(93)90010-L_BIB18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problems in networks: a survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90010-L_BIB19","unstructured":"P. Winter and J. MacGregor Smith, Path-distance heuristics for the Steiner problem in undirected networks, Algorithmica, to appear."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390010L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390010L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:53:07Z","timestamp":1757451187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390010L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0166218X9390010L"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90010-l","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1993,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Heuristics for the minimum rectilinear Steiner tree problem: new algorithms and a computational study","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(93)90010-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}