{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T00:05:29Z","timestamp":1717805129866},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T00:00:00Z","timestamp":1424131200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10878-015-9834-5","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T10:48:47Z","timestamp":1424170127000},"page":"1461-1478","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Heuristics for the network design problem with connectivity requirements"],"prefix":"10.1007","volume":"31","author":[{"given":"Roman E.","family":"Shangin","sequence":"first","affiliation":[]},{"given":"Panos","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,17]]},"reference":[{"key":"9834_CR1","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.ejor.2013.03.037","volume":"229","author":"E Alvarez-Mirandaa","year":"2013","unstructured":"Alvarez-Mirandaa E, Ljubicb I, Toth P (2013) Exact approaches for solving robust prize-collecting Steiner tree problems. Eur J Oper Res 229:599\u2013612","journal-title":"Eur J Oper Res"},{"key":"9834_CR2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-012-0537-8","volume":"141","author":"N Bansal","year":"2013","unstructured":"Bansal N, Khandekar R, Konemann J (2013) On generalizations of network design problems with degree bounds. Math Program 141:479\u2013506","journal-title":"Math Program"},{"key":"9834_CR3","first-page":"97","volume":"47","author":"H Beck","year":"1993","unstructured":"Beck H, Candia A (1993) An heuristic for the minimum spanning 2-tree problem. Comput Sci 47:97\u2013109","journal-title":"Comput Sci"},{"key":"9834_CR4","first-page":"107","volume":"15","author":"H Beck","year":"1993","unstructured":"Beck H, Candia A, Bravo H (1993) Optimal design of invulnerable networks. Res Report 15:107\u2013113","journal-title":"Res Report"},{"key":"9834_CR5","first-page":"104","volume":"9","author":"H Beck","year":"2000","unstructured":"Beck H, Candia A (2000) Heuristics for minimum spanning k-trees. Invest Oper 9:104\u2013116","journal-title":"Invest Oper"},{"key":"9834_CR6","first-page":"444","volume":"12","author":"H Beltran","year":"1993","unstructured":"Beltran H, Skorin-Kapov D (1993) On minimum cost isolated failure immune network. Telecommun Syst Model Anal 12:444\u2013453","journal-title":"Telecommun Syst Model Anal"},{"key":"9834_CR7","unstructured":"Bern M (1987) Networks design problems: Steiner trees and spanning k-trees, Ph. D. Thesis. University of Berkeley"},{"key":"9834_CR8","volume-title":"On the spanning k-tree problem","author":"L Cai","year":"1992","unstructured":"Cai L, Maffray F (1992) On the spanning k-tree problem. University of Toronto, Toronto"},{"key":"9834_CR9","volume-title":"On spanning 2-trees in a graph","author":"L Cai","year":"1996","unstructured":"Cai L (1996) On spanning 2-trees in a graph. University of Hong Kong, Hong Kong"},{"key":"9834_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-1-4615-1507-4_8","volume":"15","author":"A Candia","year":"2002","unstructured":"Candia A, Bravo HA (2002) Simulated annealing approach for minimum cost isolated failure immune networks. Ess. Surv. Metaheuristics. 15:169\u2013183","journal-title":"Ess. Surv. Metaheuristics."},{"key":"9834_CR11","first-page":"891","volume":"42","author":"B Dengiza","year":"2010","unstructured":"Dengiza B, Altiparmak F, Belgin O (2010) Design of reliable communication networks: A hybrid ant colony optimization algorithm. IIE Trans 42:891","journal-title":"IIE Trans"},{"key":"9834_CR12","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1109\/TNET.2011.2170849","volume":"20","author":"T Dinh","year":"2012","unstructured":"Dinh T et al (2012) On new approaches of assessing network vulnerability: hardness and approximation. IEEE\/ACM Trans Netw 20:609\u2013619","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9834_CR13","first-page":"286","volume":"1","author":"B Elshqeirat","year":"2013","unstructured":"Elshqeirat B, Soh S, Lazarescu M (2013) Dynamic programming for minimal cost topology with reliability constraint. Adv Comput Netw 1:286\u2013290","journal-title":"Adv Comput Netw"},{"key":"9834_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.3230110304","volume":"11","author":"A Farley","year":"1981","unstructured":"Farley A (1981) Networks immune to isolated failures. Networks 11:255\u2013268","journal-title":"Networks"},{"key":"9834_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey M, Johnson D (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1:237\u2013267","journal-title":"Theor Comput Sci"},{"key":"9834_CR16","doi-asserted-by":"crossref","unstructured":"Ghashghai E, Rardin R (2002) Using genetic algorithms to find good k-tree subgraphs. Evol Optim 48:399\u2013413","DOI":"10.1007\/0-306-48041-7_16"},{"key":"9834_CR17","volume-title":"Algorithmic graph theory and perfect graphs","author":"M Golumbic","year":"1980","unstructured":"Golumbic M (1980) Algorithmic graph theory and perfect graphs. Academic Press, New York"},{"key":"9834_CR18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0166-218X(92)00122-3","volume":"48","author":"D Granot","year":"1994","unstructured":"Granot D, Skorin-Kapov D (1994) On some optimization problems on k-trees and partial k-trees. Discre Appl Math 48:129\u2013145","journal-title":"Discre Appl Math"},{"key":"9834_CR19","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0802024","volume":"2","author":"M Grotschel","year":"1992","unstructured":"Grotschel M, Monma C (1992) Facets for polyhedra arising in the design of communication networks with low-connectity constraints. SIAM J Optim 2:474\u2013504","journal-title":"SIAM J Optim"},{"key":"9834_CR20","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1002\/dac.1391","volume":"26","author":"A Haidine","year":"2013","unstructured":"Haidine A (2013) Design of reliable fiber-based distribution networks modeled by multi-objective combinatorial optimization. Int J Commun Syst 26:1227\u20131242","journal-title":"Int J Commun Syst"},{"key":"9834_CR21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-1-4419-1665-5_3","volume":"146","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovic N, Brimberg J (2010) Handbook of Metaheuristics. Intern Series Oper Res Manage Sci 146:61\u201386","journal-title":"Intern Series Oper Res Manage Sci"},{"key":"9834_CR22","doi-asserted-by":"crossref","first-page":"3104","DOI":"10.1109\/JLT.2013.2277863","volume":"31","author":"M Johnston","year":"2013","unstructured":"Johnston M, Lee H, Modiano E (2013) Robust network design for stochastic traffic demands. J Lightwave Technol 31:3104\u20133116","journal-title":"J Lightwave Technol"},{"key":"9834_CR23","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1016\/j.jcss.2013.01.019","volume":"79","author":"R Khandekara","year":"2013","unstructured":"Khandekara R, Kortsarzb G, Nutovc Z (2013) On some network design problems with degree constraints. J Comput Syst Sci 79:725\u2013736","journal-title":"J Comput Syst Sci"},{"key":"9834_CR24","first-page":"430","volume":"23","author":"A Konak","year":"2011","unstructured":"Konak A, Smith A (2011) Efficient optimization of reliable two-node connected networks: a biobjective approach. Inf Sci Technol 23:430\u2013445","journal-title":"Inf Sci Technol"},{"key":"9834_CR25","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.20046","volume":"45","author":"TL Magnanti","year":"2005","unstructured":"Magnanti TL, Raghavan S (2005) Strong formulations for network design problems with connectivity requirements. Networks 45:61\u201379","journal-title":"Networks"},{"key":"9834_CR26","volume-title":"Handbook of optimization in complex","author":"P Pardalos","year":"2011","unstructured":"Pardalos P, Thai MT (2011) Handbook of optimization in complex. Springer, New York"},{"key":"9834_CR27","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R Prim","year":"1957","unstructured":"Prim R (1957) Shortest connection networks and some generalizations. Bell Syst Technol J 36:1389\u20131401","journal-title":"Bell Syst Technol J"},{"key":"9834_CR28","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D Rose","year":"1970","unstructured":"Rose D (1970) Triangulated graphs and the elimination process. J Math Anal Appl 32:597\u2013609","journal-title":"J Math Anal Appl"},{"key":"9834_CR29","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"41","author":"D Rose","year":"1974","unstructured":"Rose D (1974) On simple characterizations of k-trees. Discret. Math. 41:317\u2013322","journal-title":"Discret. Math."},{"key":"9834_CR30","unstructured":"Shi Q (2008) Efficient algorithm for network center\/covering location optimazation problems. Ph.D. thesis, School of Computing Science-Simon Fraser University"},{"key":"9834_CR31","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.endm.2011.05.006","volume":"37","author":"L Simonetti","year":"2011","unstructured":"Simonetti L, Protti F, Frota Y (2011) New branch-and-bound algorithms for k-cardinality tree problems. Electron Notes Discret Math 37:27\u201332","journal-title":"Electron Notes Discret Math"},{"key":"9834_CR32","volume-title":"Handbook of optimization in complex networks: theory and applications","author":"MT Thai","year":"2011","unstructured":"Thai MT, Pardalos P (2011) Handbook of optimization in complex networks: theory and applications. Springer, New York"},{"key":"9834_CR33","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J Wald","year":"1983","unstructured":"Wald J, Colbourn C (1983) Steiner trees, partial 2-trees and minimum IFI networks. Networks 13:159\u2013167","journal-title":"Networks"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9834-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9834-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9834-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T07:17:18Z","timestamp":1717744638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9834-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,17]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9834"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9834-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,17]]}}}