{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:06:07Z","timestamp":1761894367435,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T00:00:00Z","timestamp":1152316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,8]]},"DOI":"10.1145\/1143997.1144110","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"619-626","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["An efficient approach to unbounded bi-objective archives -"],"prefix":"10.1145","author":[{"given":"Adam","family":"Berry","sequence":"first","affiliation":[{"name":"University of Tasmania, Hobart, Tasmania, Australia"}]},{"given":"Peter","family":"Vamplew","sequence":"additional","affiliation":[{"name":"University of Ballarat, Ballarat, Victoria, Australia"}]}],"member":"320","published-online":{"date-parts":[[2006,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume":"197","author":"Bayer R.","unstructured":"Bayer , R. , Symmetric Binary B-Trees: Data Structures and Maintenance Algorithms. Acta Informatica , 197 2.]] Bayer, R., Symmetric Binary B-Trees: Data Structures and Maintenance Algorithms. Acta Informatica, 1972.]]","journal-title":"Maintenance Algorithms. Acta Informatica"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of IEEE Special Issue on Computational Geometry","author":"Chiang Y.-J.","year":"1992","unstructured":"Chiang , Y.-J. and Tamassia , R ., Dynamic Algorithms in Computational Geometry (Revised Version) . Proceedings of IEEE Special Issue on Computational Geometry , 1992 .]] Chiang, Y.-J. and Tamassia, R., Dynamic Algorithms in Computational Geometry (Revised Version). Proceedings of IEEE Special Issue on Computational Geometry, 1992.]]"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of PPSN VI. 2000: Springer. LNCS No.","author":"Deb K.","year":"1917","unstructured":"Deb , K. , Agrawal , S. , Pratab , A. , and Meyarivan , T . A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II . in Proceedings of PPSN VI. 2000: Springer. LNCS No. 1917 .]] Deb, K., Agrawal, S., Pratab, A., and Meyarivan, T. A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. in Proceedings of PPSN VI. 2000: Springer. LNCS No. 1917.]]"},{"key":"e_1_3_2_1_4_1","first-page":"305","volume":"200","author":"Fieldsend J. E.","unstructured":"Fieldsend , J. E. , Everson , R. M. , and Singh , S. , Using Unconstrained Elite Archives for Multiobjective Optimization. IEEE Transactions on Evolutionary Computation , 200 3. 7(3): p. 305 -- 323 .]] Fieldsend, J. E., Everson, R. M., and Singh, S., Using Unconstrained Elite Archives for Multiobjective Optimization. IEEE Transactions on Evolutionary Computation, 2003. 7(3): p. 305--323.]]","journal-title":"Evolutionary Computation"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"e_1_3_2_1_6_1","first-page":"503","volume":"200","author":"Jensen M. T.","unstructured":"Jensen , M. T. , Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and Other Algorithms . IEEE Transactions on Evolutionary Computation , 200 3. 7(5): p. 503 -- 515 .]] Jensen, M. T., Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and Other Algorithms. IEEE Transactions on Evolutionary Computation, 2003. 7(5): p. 503--515.]]","journal-title":"Evolutionary Computation"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568167"},{"volume-title":"Proceedings of PPSN VI. 2000: Springer.]]","author":"Knowles J. D.","key":"e_1_3_2_1_8_1","unstructured":"Knowles , J. D. , Corne , D. W. , and Oates , M. J . The Pareto-Envelope based Selection Algorithm for Multiobjective Optimization . in Proceedings of PPSN VI. 2000: Springer.]] Knowles, J. D., Corne, D. W., and Oates, M. J. The Pareto-Envelope based Selection Algorithm for Multiobjective Optimization. in Proceedings of PPSN VI. 2000: Springer.]]"},{"volume-title":"Comparison of Data Structures for Storing Pareto-sets in MOEAs. in Congress on Evolutionary Computation. 2002: IEEE Service Center.]]","author":"Mostaghim S.","key":"e_1_3_2_1_9_1","unstructured":"Mostaghim , S. , Teich , J. , and Tyagi , A . Comparison of Data Structures for Storing Pareto-sets in MOEAs. in Congress on Evolutionary Computation. 2002: IEEE Service Center.]] Mostaghim, S., Teich, J., and Tyagi, A. Comparison of Data Structures for Storing Pareto-sets in MOEAs. in Congress on Evolutionary Computation. 2002: IEEE Service Center.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms.","author":"Schaffer J. D.","year":"1985","unstructured":"Schaffer , J. D. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms . in Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms. 1985 .]] Schaffer, J. D. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. in Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms. 1985.]]"},{"key":"e_1_3_2_1_11_1","first-page":"221","volume":"199","author":"Srinivas N.","unstructured":"Srinivas , N. and Deb , K. , Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation , 199 4. 2(3): p. 221 -- 248 .]] Srinivas, N. and Deb, K., Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, 1994. 2(3): p. 221--248.]]","journal-title":"Genetic Algorithms. Evolutionary Computation"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"},{"key":"e_1_3_2_1_13_1","first-page":"95","volume":"200","author":"Zitzler E.","unstructured":"Zitzler , E. , Laumanns , M. , and Thiele , L. SPEA2: Improving the Strength Pareto Evolutionary Algorithm. in EUROGEN 200 1. p. 95 -- 100 .]] Zitzler, E., Laumanns, M., and Thiele, L. SPEA2: Improving the Strength Pareto Evolutionary Algorithm. in EUROGEN 2001. p. 95--100.]]","journal-title":"EUROGEN"},{"key":"e_1_3_2_1_14_1","volume-title":"An Evolutionary Algorithm for Multiobjective Optimization: The Strength Pareto Approach","author":"Zitzler E.","year":"1998","unstructured":"Zitzler , E. and Thiele , L. , An Evolutionary Algorithm for Multiobjective Optimization: The Strength Pareto Approach . 1998 , Computer Engineering and Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH) .]] Zitzler, E. and Thiele, L., An Evolutionary Algorithm for Multiobjective Optimization: The Strength Pareto Approach. 1998, Computer Engineering and Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH).]]"}],"event":{"name":"GECCO06: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Seattle Washington USA","acronym":"GECCO06"},"container-title":["Proceedings of the 8th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143997.1144110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:14Z","timestamp":1750259654000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143997.1144110"}},"subtitle":["introducing the mak_tree algorithm"],"short-title":[],"issued":{"date-parts":[[2006,7,8]]},"references-count":14,"alternative-id":["10.1145\/1143997.1144110","10.1145\/1143997"],"URL":"https:\/\/doi.org\/10.1145\/1143997.1144110","relation":{},"subject":[],"published":{"date-parts":[[2006,7,8]]},"assertion":[{"value":"2006-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}