[{"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","title":"A New Data Structure for the Nondominance Problem in Multi-objective Optimization","status":"public","year":"2003","publication_identifier":{"isbn":["9783540018698","9783540369707"],"issn":["0302-9743"]},"author":[{"last_name":"Schütze","first_name":"Oliver","full_name":"Schütze, Oliver"}],"user_id":"15701","doi":"10.1007/3-540-36970-8_36","language":[{"iso":"eng"}],"_id":"16664","publication":"Lecture Notes in Computer Science","citation":{"ama":"Schütze O. A New Data Structure for the Nondominance Problem in Multi-objective Optimization. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2003. doi:<a href=\"https://doi.org/10.1007/3-540-36970-8_36\">10.1007/3-540-36970-8_36</a>","bibtex":"@inbook{Schütze_2003, place={Berlin, Heidelberg}, title={A New Data Structure for the Nondominance Problem in Multi-objective Optimization}, DOI={<a href=\"https://doi.org/10.1007/3-540-36970-8_36\">10.1007/3-540-36970-8_36</a>}, booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver}, year={2003} }","mla":"Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href=\"https://doi.org/10.1007/3-540-36970-8_36\">10.1007/3-540-36970-8_36</a>.","chicago":"Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/3-540-36970-8_36\">https://doi.org/10.1007/3-540-36970-8_36</a>.","short":"O. Schütze, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.","apa":"Schütze, O. (2003). A New Data Structure for the Nondominance Problem in Multi-objective Optimization. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-36970-8_36\">https://doi.org/10.1007/3-540-36970-8_36</a>","ieee":"O. Schütze, “A New Data Structure for the Nondominance Problem in Multi-objective Optimization,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2003."},"type":"book_chapter","department":[{"_id":"101"}],"date_created":"2020-04-16T09:57:05Z","place":"Berlin, Heidelberg"},{"citation":{"chicago":"Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/3-540-36970-8_9\">https://doi.org/10.1007/3-540-36970-8_9</a>.","short":"O. Schütze, S. Mostaghim, M. Dellnitz, J. Teich, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.","apa":"Schütze, O., Mostaghim, S., Dellnitz, M., &#38; Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-36970-8_9\">https://doi.org/10.1007/3-540-36970-8_9</a>","ieee":"O. Schütze, S. Mostaghim, M. Dellnitz, and J. Teich, “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2003.","ama":"Schütze O, Mostaghim S, Dellnitz M, Teich J. Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2003. doi:<a href=\"https://doi.org/10.1007/3-540-36970-8_9\">10.1007/3-540-36970-8_9</a>","bibtex":"@inbook{Schütze_Mostaghim_Dellnitz_Teich_2003, place={Berlin, Heidelberg}, title={Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques}, DOI={<a href=\"https://doi.org/10.1007/3-540-36970-8_9\">10.1007/3-540-36970-8_9</a>}, booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver and Mostaghim, Sanaz and Dellnitz, Michael and Teich, Jürgen}, year={2003} }","mla":"Schütze, Oliver, et al. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href=\"https://doi.org/10.1007/3-540-36970-8_9\">10.1007/3-540-36970-8_9</a>."},"publication":"Lecture Notes in Computer Science","date_created":"2020-04-16T09:58:10Z","place":"Berlin, Heidelberg","department":[{"_id":"101"}],"type":"book_chapter","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540018698","9783540369707"]},"author":[{"last_name":"Schütze","first_name":"Oliver","full_name":"Schütze, Oliver"},{"full_name":"Mostaghim, Sanaz","last_name":"Mostaghim","first_name":"Sanaz"},{"full_name":"Dellnitz, Michael","last_name":"Dellnitz","first_name":"Michael"},{"full_name":"Teich, Jürgen","first_name":"Jürgen","last_name":"Teich"}],"title":"Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques","status":"public","year":"2003","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","_id":"16665","language":[{"iso":"eng"}],"user_id":"15701","doi":"10.1007/3-540-36970-8_9"}]