{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:23Z","timestamp":1740122423047,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["303928\/2018-2"],"award-info":[{"award-number":["303928\/2018-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["CEX - PPM-00164\/17"],"award-info":[{"award-number":["CEX - PPM-00164\/17"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00835-w","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:03:16Z","timestamp":1641772996000},"page":"379-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem"],"prefix":"10.1007","volume":"44","author":[{"given":"Alexandre Salles","family":"da Cunha","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"key":"835_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.comgeo.2012.07.003","volume":"46","author":"E Ackerman","year":"2013","unstructured":"Ackerman E, Gelander T, Pinchasi R (2013) Ice-creams and wedge graphs. Comput Geom 46:213\u2013218","journal-title":"Comput Geom"},{"issue":"3","key":"835_CR2","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.comgeo.2012.09.008","volume":"46","author":"G Aloupis","year":"2013","unstructured":"Aloupis G, Damian M, Flatland R, Korman M, Ozkan O, Rappaport D, Wuhrer S (2013) Establishing strong connectivity using optimal radius half-disk antennas. Comput Geom 46(3):328\u2013339","journal-title":"Comput Geom"},{"key":"835_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00453-015-0076-9","volume":"77","author":"R Aschner","year":"2017","unstructured":"Aschner R, Katz MJ (2017) Bounded-angle spanning tree: modeling networks with angular constraints. Algorithmica 77:349\u2013373","journal-title":"Algorithmica"},{"issue":"9","key":"835_CR4","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.comgeo.2013.06.003","volume":"46","author":"R Aschner","year":"2013","unstructured":"Aschner R, Katz MJ, Morgenstern G (2013) Symmetric connectivity with directional antennas. Comput Geom 46(9):1017\u20131026","journal-title":"Comput Geom"},{"key":"835_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk A, Nemhauser GL, Savesbergh MWP (2000) Conflict graphs in solving integer programming problems. Eur J Oper Res 121:40\u201355","journal-title":"Eur J Oper Res"},{"key":"835_CR6","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s10589-015-9788-7","volume":"63","author":"L Bicalho","year":"2016","unstructured":"Bicalho L, da Cunha AS, Lucena A (2016) Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem. Comput Optim Appl 63:755\u2013792","journal-title":"Comput Optim Appl"},{"key":"835_CR7","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Kaklamanis C, Kranakis E, Krizanc D, Wiese A (2008) Communication in wireless networks with directional antennas. In: Heide FMAD (ed) Proceedings of the twentieth annual symposium on parallelism in algorithms and architectures. Association for Computing Machinery, pp 344\u2013351","DOI":"10.1145\/1378533.1378592"},{"key":"835_CR8","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.comgeo.2011.05.003","volume":"44","author":"P Carmin","year":"2011","unstructured":"Carmin P, Katz MJ, Lotker Z, Ros\u00e9n A (2011) Connectivity guarantees for wireless networks with directional antennas. Comput Geom 44:477\u2013485","journal-title":"Comput Geom"},{"key":"835_CR9","doi-asserted-by":"publisher","first-page":"104775","DOI":"10.1016\/j.cor.2019.104775","volume":"112","author":"AS da Cunha","year":"2019","unstructured":"da Cunha AS, Lucena A (2019) Modeling and solving the angular constrained minimum spanning tree problem. Comput Oper Res 112:104775","journal-title":"Comput Oper Res"},{"issue":"4","key":"835_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/dac.1348","volume":"26","author":"HN Dai","year":"2013","unstructured":"Dai HN, Ng KW, Li M, Wu MY (2013) An overview of using directional antennas in wireless networks. Int J Commun Syst 26(4):413\u2013448","journal-title":"Int J Commun Syst"},{"issue":"03","key":"835_CR11","doi-asserted-by":"publisher","first-page":"1350008","DOI":"10.1142\/S1793830913500080","volume":"05","author":"M Damian","year":"2013","unstructured":"Damian M, Flatland R (2013) Spanning properties of graphs induced by directional antennas. Discrete Math Algorithms Appl 05(03):1350008","journal-title":"Discrete Math Algorithms Appl"},{"issue":"2","key":"835_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmark optimization software with performance profiles. Math Program 91(2):201\u2013213","journal-title":"Math Program"},{"issue":"1","key":"835_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds J (1971) Matroids and the greedy algorithm. Math Program 1(1):127\u2013136","journal-title":"Math Program"},{"key":"835_CR14","unstructured":"FICO XPRESS: XPRESS mixed integer optimization package, release 8.4 (2017)"},{"key":"835_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G Nemhauser","year":"1974","unstructured":"Nemhauser G, Trotter L (1974) Properties of vertex packing and independence system polyhedra. Math Program 6:48\u201361","journal-title":"Math Program"},{"key":"835_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M Padberg","year":"1973","unstructured":"Padberg M (1973) On the facial structure of set packing polyhedra. Math Program 5:199\u2013215","journal-title":"Math Program"},{"key":"835_CR17","first-page":"511","volume":"17","author":"MW Padberg","year":"1983","unstructured":"Padberg MW, Wolsey LA (1983) Trees and cuts. Ann Discrete Math 17:511\u2013517","journal-title":"Ann Discrete Math"},{"key":"835_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1111\/j.1475-3995.2011.00805.x","volume":"19","author":"S Rebennack","year":"2012","unstructured":"Rebennack S, Reinelt G, Pardalos PM (2012) A tutorial on branch and cut algorithms for the maximum stable set problem. Int Trans Oper Res 19:161\u2013199","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"835_CR19","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB: a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"835_CR20","unstructured":"Tran TH (2017) Connectivity problems in wireless sensor networks with directional antennas. Ph.D. thesis, The University of Texas at Dallas, Computer Science Department"},{"issue":"3","key":"835_CR21","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s10878-019-00509-8","volume":"39","author":"T Tran","year":"2020","unstructured":"Tran T, Huynh DT (2020) The complexity of symmetric connectivity in directional wireless sensor networks. J Comb Optim 39(3):662\u2013686","journal-title":"J Comb Optim"},{"key":"835_CR22","doi-asserted-by":"crossref","unstructured":"Tran T, An MK, Huynh DT (2017) Symmetric connectivity in wsns equipped with multiple directional antennas. In: 2017 international conference on computing, networking and communications (ICNC), pp 609\u2013614","DOI":"10.1109\/ICCNC.2017.7876199"},{"issue":"3","key":"835_CR23","doi-asserted-by":"publisher","first-page":"51:1","DOI":"10.1145\/2594770","volume":"10","author":"Z Yu","year":"2014","unstructured":"Yu Z, Teng J, Bai X, Xuan D, Jia W (2014) Connected coverage in wireless networks with directional antennas. ACM Trans Sens Netw 10(3):51:1-51:28","journal-title":"ACM Trans Sens Netw"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00835-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00835-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00835-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:30:16Z","timestamp":1659079816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00835-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["835"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00835-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"5 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}