default search action
Evolutionary Multiobjective Optimization 2005
- Ajith Abraham, Lakhmi C. Jain, Robert R. Goldberg:
Evolutionary Multiobjective Optimization. Advanced Information and Knowledge Processing, Springer 2005, ISBN 1852337877 - Ajith Abraham, Lakhmi C. Jain:
Evolutionary Multiobjective Optimization. 1-6 - Carlos A. Coello Coello:
Recent Trends in Evolutionary Multiobjective Optimization. 7-32 - Marco Laumanns:
Self-adaptation and Convergence of Multiobjective Evolutionary Algorithms in Continuous Search Spaces. 33-53 - Christine L. Mumford-Valenzuela:
A Simple Approach to Evolutionary Multiobjective Optimization. 55-79 - Sanaz Mostaghim, Jürgen Teich:
Quad-trees: A Data Structure for Storing Pareto Sets in Multiobjective Evolutionary Algorithms with Elitism. 81-104 - Kalyanmoy Deb, Lothar Thiele, Marco Laumanns, Eckart Zitzler:
Scalable Test Problems for Evolutionary Multiobjective Optimization. 105-145 - Dipti Srinivasan, Tian Hou Seow:
Particle Swarm Inspired Evolutionary Algorithm (PS-EA) for Multi-Criteria Optimization Problems. 147-165 - D. Dumitrescu, Crina Grosan, Mihai Oltean:
Evolving Continuous Pareto Regions. 167-199 - Tomoyuki Hiroyasu, Mitsunori Miki, Jiro Kamiura, Shinya Watanabe, Hiro Hiroyasu:
MOGADES: Multi-Objective Genetic Algorithm with Distributed Environment Scheme. 201-227 - Efrén Mezura-Montes, Carlos A. Coello Coello:
Use of Multiobjective Optimization Concepts to Handle Constraints in Genetic Algorithms. 229-254 - Robert R. Goldberg, Natalie Hammerman:
Multi-criteria Optimization of Finite State Automata: Maximizing Performance while Minimizing Description Length. 255-271 - Nikos D. Lagaros, Manolis Papadrakakis, Vagelis Plevris:
Multiobjective Optimization of Space Structures under Static and Seismic Loading Conditions. 273-300
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.