{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:54:25Z","timestamp":1718553265905},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T00:00:00Z","timestamp":1447632000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-015-9970-y","type":"journal-article","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T11:51:20Z","timestamp":1447674680000},"page":"389-402","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement"],"prefix":"10.1007","volume":"33","author":[{"given":"J. M. G.","family":"Salmer\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Aparicio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. G.","family":"Casado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. M. T.","family":"Hendrix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"G.-T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,16]]},"reference":[{"key":"9970_CR1","doi-asserted-by":"publisher","unstructured":"Adler A (1983) On the bisection method for triangles. Math Comput 40(162):571\u2013574. doi:\n                        10.1090\/S0025-5718-1983-0689473-5","DOI":"10.1090\/S0025-5718-1983-0689473-5"},{"key":"9970_CR2","doi-asserted-by":"publisher","unstructured":"Aparicio G, Casado LG, Hendrix EMT, Garc\u00eda I, G-T\u00f3th B (2013) On computational aspects of a regular n-simplex bisection. In: Proceedings of the 8th International conference on P2P, parallel, grid, cloud and internet computing, IEEE Computer Society, Compiegne, France, pp. 513\u2013518. doi:\n                        10.1109\/3PGCIC.2013.88","DOI":"10.1109\/3PGCIC.2013.88"},{"key":"9970_CR3","doi-asserted-by":"publisher","unstructured":"Aparicio G, Casado LG, G-T\u00f3th B, Hendrix EMT, Garc\u00eda I (2014) Heuristics to reduce the number of simplices in longest edge bisection refinement of a regular n-simplex. Computational science and its applications ICCSA 2014. Lecture notes in computer science, vol 8580. Springer International Publishing, Cham, pp 115\u2013125. doi:\n                        10.1007\/978-3-319-09129-7_9","DOI":"10.1007\/978-3-319-09129-7_9"},{"issue":"1","key":"9970_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.15388\/Informatica.2015.36","volume":"26","author":"G Aparicio","year":"2015","unstructured":"Aparicio G, Casado LG, G-T\u00f3th B, Hendrix EMT, Garc\u00eda I (2015) On the minimim number of simplex shapes in longest edge bisection refinement of a regular n-simplex. Informatica 26(1):17\u201332. doi:\n                        10.15388\/Informatica.2015.36","journal-title":"Informatica"},{"key":"9970_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.scico.2013.05.002","volume":"90","author":"A Hannukainen","year":"2014","unstructured":"Hannukainen A, Korotov S, K\u0159\u00ed\u017eek M (2014) On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions. Sci Comput Program 90:34\u201341. doi:\n                        10.1016\/j.scico.2013.05.002","journal-title":"Sci Comput Program"},{"key":"9970_CR6","doi-asserted-by":"publisher","unstructured":"Hendrix EMT, Casado LG, Amaral P (2012) Global optimization simplex bisection revisited based on considerations by Reiner Horst. In: Computational science and its applications ICCSA 2012. Lecture notes in computer science, vol 7335, Springer, Berlin, pp 159\u2013173. doi:\n                        10.1007\/978-3-642-31137-6_12","DOI":"10.1007\/978-3-642-31137-6_12"},{"key":"9970_CR7","doi-asserted-by":"publisher","unstructured":"Herrera JFR, Casado LG, Hendrix EMT, Garc\u00eda I (2014) On simplicial longest edge bisection in Lipschitz global optimization. In: Computational science and its applications ICCSA 2014. Lecture notes in computer science, vol 8580, Springer International Publishing, Cham, pp 104\u2013114. doi:\n                        10.1007\/978-3-319-09129-7_8","DOI":"10.1007\/978-3-319-09129-7_8"},{"issue":"218","key":"9970_CR8","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1090\/S0025-5718-97-00809-0","volume":"66","author":"R Horst","year":"1997","unstructured":"Horst R (1997) On generalized bisection of \n                        $$n$$\n                        \n                            \n                                            \n                                n\n                            \n                        \n                    -simplices. Math Comput 66(218):691\u2013698. doi:\n                        10.1090\/S0025-5718-97-00809-0","journal-title":"Math Comput"},{"key":"9970_CR9","doi-asserted-by":"publisher","unstructured":"Mitchell WF (1989) A comparison of adaptive refinement techniques for elliptic problems. ACM Trans Math Softw 15(4):326\u2013347. doi:\n                        10.1145\/76909.76912","DOI":"10.1145\/76909.76912"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9970-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9970-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9970-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9970-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T19:06:43Z","timestamp":1553627203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9970-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,16]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9970"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9970-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,16]]}}}