{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T05:05:07Z","timestamp":1773983107919,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"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":9390,"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":[[1987,11]]},"DOI":"10.1016\/0166-218x(87)90021-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"199-210","source":"Crossref","is-referenced-by-count":22,"title":["The telephonic switching centre network problem: formalization and computational experience"],"prefix":"10.1016","volume":"18","author":[{"given":"Henrique Pacca L.","family":"Luna","sequence":"first","affiliation":[]},{"given":"Nivio","family":"Ziviani","sequence":"additional","affiliation":[]},{"given":"Regina Helena B.","family":"Cabral","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90021-7_BIB1","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":"Math. Programming"},{"key":"10.1016\/0166-218X(87)90021-7_BIB2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","article-title":"An integer linear programming approach to the Steiner problem in graphs","volume":"10","author":"Aneja","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0166-218X(87)90021-7_BIB3","series-title":"II Congresso Latino-americano de Pesquisa Operacional e Engenharia de Sistemas","first-page":"206","article-title":"O problema de Steiner em grafos orientados","author":"Maculan","year":"1984"},{"key":"10.1016\/0166-218X(87)90021-7_BIB4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning tree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0166-218X(87)90021-7_BIB5","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalization","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0166-218X(87)90021-7_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0166-218X(87)90021-7_BIB7","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1962"},{"key":"10.1016\/0166-218X(87)90021-7_BIB8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","article-title":"Optimal facility location with concave costs","volume":"22","author":"Soland","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(87)90021-7_BIB9","series-title":"Private Communication","author":"Mateus","year":"1983"},{"key":"10.1016\/0166-218X(87)90021-7_BIB10","series-title":"Private Communication","author":"P\u0101due","year":"1983"},{"key":"10.1016\/0166-218X(87)90021-7_BIB11","series-title":"Projeto Operacional do Programa PLOTTER \u2014 Plano Otimizador de Topologia em Rede","author":"Ziviani","year":"1983"},{"key":"10.1016\/0166-218X(87)90021-7_BIB12","series-title":"Modelagem Matem\u0101tica do Problema de Planejamento de Rede Telefonica de Alimenta\u00e7\u00e3o","author":"Luna","year":"1984"},{"key":"10.1016\/0166-218X(87)90021-7_BIB13","series-title":"PLOTTER \u2014 Plano Otimizador de Topologia em Rede: Manual do Sistema","author":"Cabral","year":"1985"},{"key":"10.1016\/0166-218X(87)90021-7_BIB14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","article-title":"An algorithm for the Steiner Problem in graphs","volume":"14","author":"Beasley","year":"1984","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:53:21Z","timestamp":1555134801000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0166218X87900217"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90021-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}