Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques

O. Schütze, S. Mostaghim, M. Dellnitz, J. Teich, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.

Download
No fulltext has been uploaded.
Book Chapter | Published | English
Author
; ; ;
Publishing Year
Book Title
Lecture Notes in Computer Science
ISSN
LibreCat-ID

Cite this

Schütze O, Mostaghim S, Dellnitz M, Teich J. Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2003. doi:10.1007/3-540-36970-8_9
Schütze, O., Mostaghim, S., Dellnitz, M., & Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_9
@inbook{Schütze_Mostaghim_Dellnitz_Teich_2003, place={Berlin, Heidelberg}, title={Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques}, DOI={10.1007/3-540-36970-8_9}, booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver and Mostaghim, Sanaz and Dellnitz, Michael and Teich, Jürgen}, year={2003} }
Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003. https://doi.org/10.1007/3-540-36970-8_9.
O. Schütze, S. Mostaghim, M. Dellnitz, and J. Teich, “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.
Schütze, Oliver, et al. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” Lecture Notes in Computer Science, 2003, doi:10.1007/3-540-36970-8_9.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar
ISBN Search