{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:04:29Z","timestamp":1773842669550,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319541563","type":"print"},{"value":"9783319541570","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-54157-0_18","type":"book-chapter","created":{"date-parts":[[2017,2,18]],"date-time":"2017-02-18T08:11:54Z","timestamp":1487405514000},"page":"252-266","source":"Crossref","is-referenced-by-count":18,"title":["A Fast Incremental BSP Tree Archive for Non-dominated Points"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Glasmachers","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,19]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry","author":"M Berg De","year":"2000","unstructured":"De Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.C.: Computational Geometry. Springer, Heidelberg (2000)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Congress on Evolutionary Computation (CEC 2002), pp. 825\u2013830. IEEE (2002)","DOI":"10.1109\/CEC.2002.1007032"},{"issue":"3","key":"18_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TEVC.2003.810733","volume":"7","author":"JE Fieldsend","year":"2003","unstructured":"Fieldsend, J.E., Everson, R.M., Singh, S.: Using unconstrained elite archives for multi-objective optimization. IEEE Trans. Evol. Comput. 7(3), 305\u2013323 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Fortin, F.A., Grenier, S., Parizeau, M.: Generalizing the improved run-time complexity algorithm for non-dominated sorting. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (2013)","DOI":"10.1145\/2463372.2463454"},{"issue":"1","key":"18_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.2007.15.1.1","volume":"15","author":"C Igel","year":"2007","unstructured":"Igel, C., Hansen, N., Roth, S.: Covariance matrix adaptation for multi-objective optimization. Evol. Comput. 15(1), 1\u201328 (2007)","journal-title":"Evol. Comput."},{"key":"18_CR6","first-page":"993","volume":"9","author":"C Igel","year":"2008","unstructured":"Igel, C., Heidrich-Meisner, V., Glasmachers, T.: Shark. J. Mach. Learn. Res. 9, 993\u2013996 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"18_CR7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"MT Jensen","year":"2003","unstructured":"Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evol. Comput. 7(5), 503\u2013515 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of the 28th International Conference on Very Large Data Bases, VLDB Endowment, pp. 275\u2013286 (2002)","DOI":"10.1016\/B978-155860869-6\/50032-9"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Krause, O., Glasmachers, T., Hansen, N., Igel, C.: Unbounded population MO-CMA-ES for the bi-objective BBOB test suite. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (2016)","DOI":"10.1145\/2908961.2931699"},{"issue":"4","key":"18_CR10","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H-T Kung","year":"1975","unstructured":"Kung, H.-T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM (JACM) 22(4), 469\u2013476 (1975)","journal-title":"J. ACM (JACM)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-19893-9_4","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2011","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Knowles, J., Laumanns, M.: On sequential online archiving of objective vectors. In: Takahashi, R.H.C., Deb, K., Wanner, E.F., Greco, S. (eds.) EMO 2011. LNCS, vol. 6576, pp. 46\u201360. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19893-9_4"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-70928-2_12","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Lukasiewycz","year":"2007","unstructured":"Lukasiewycz, M., Gla\u00df, M., Haubelt, C., Teich, J.: Symbolic archive representation for a fast nondominance test. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 111\u2013125. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-70928-2_12"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Mostaghim, S., Teich, J., Tyagi, A.: Comparison of data structures for storing pareto-sets in MOEAs. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC), vol. 1, pp. 843\u2013848. IEEE (2002)","DOI":"10.1109\/CEC.2002.1007035"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 467\u2013478. ACM (2003)","DOI":"10.1145\/872757.872814"},{"key":"18_CR15","first-page":"151","volume":"11","author":"JM Robson","year":"1979","unstructured":"Robson, J.M.: The height of binary search trees. Aust. Comput. J. 11, 151\u2013153 (1979)","journal-title":"Aust. Comput. J."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/3-540-36970-8_36","volume-title":"Evolutionary Multi-Criterion Optimization","author":"O Sch\u00fctze","year":"2003","unstructured":"Sch\u00fctze, O.: A new data structure for the nondominance problem in multi-objective optimization. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 509\u2013518. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36970-8_36"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Vo\u00df, T., Hansen, N., Igel, C.: Improved step size adaptation for the MO-CMA-ES. In: 12th Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 487\u2013494. ACM (2010)","DOI":"10.1145\/1830483.1830573"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-54157-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:53:35Z","timestamp":1498388015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-54157-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319541563","9783319541570"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-54157-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}