Search the dblp DataBase
Oliver Schütze :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Oliver Schütze , Alessandro Dell'Aere , Michael Dellnitz On Continuation Methods for the Numerical Treatment of Multi-Objective Optimization Problems. [Citation Graph (0, 0)][DBLP ] Practical Approaches to Multi-Objective Optimization, 2005, pp:- [Conf ] Oliver Schütze A New Data Structure for the Nondominance Problem in Multi-objective Optimization. [Citation Graph (0, 0)][DBLP ] EMO, 2003, pp:509-518 [Conf ] Oliver Schütze , Sanaz Mostaghim , Michael Dellnitz , Jürgen Teich Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. [Citation Graph (0, 0)][DBLP ] EMO, 2003, pp:118-132 [Conf ] Oliver Schütze , Laetitia Jourdan , Thomas Legrand , El-Ghazali Talbi , Jean Luc Wojkiewicz A Multi-objective Approach to the Design of Conducting Polymer Composites for Electromagnetic Shielding. [Citation Graph (0, 0)][DBLP ] EMO, 2006, pp:590-603 [Conf ] Oliver Schütze , Marco Laumanns , Emilia Tantar , Carlos A. Coello Coello , El-Ghazali Talbi Convergence of stochastic search algorithms to gap-free pareto front approximations. [Citation Graph (0, 0)][DBLP ] GECCO, 2007, pp:892-901 [Conf ] Oliver Schütze , Carlos A. Coello Coello , El-Ghazali Talbi Approximating the epsilon -Efficient Set of an MOP with Stochastic Search Algorithms. [Citation Graph (0, 0)][DBLP ] MICAI, 2007, pp:128-138 [Conf ] A new memetic strategy for the numerical treatment of multi-objective optimization problems. [Citation Graph (, )][DBLP ] Computing finite size representations of the set of approximate solutions of an MOP with stochastic search algorithms. [Citation Graph (, )][DBLP ] Evolutionary continuation methods for optimization problems. [Citation Graph (, )][DBLP ] Using gradient information for multi-objective problems in the evolutionary context. [Citation Graph (, )][DBLP ] New challenges for memetic algorithms on continuous multi-objective problems. [Citation Graph (, )][DBLP ] Some comments on GD and IGD and relations to the Hausdorff distance. [Citation Graph (, )][DBLP ] Approximating the Knee of an MOP with Stochastic Search Algorithms. [Citation Graph (, )][DBLP ] Approximate Solutions in Space Mission Design. [Citation Graph (, )][DBLP ] Using gradient-based information to deal with scalability in multi-objective evolutionary algorithms. [Citation Graph (, )][DBLP ] Computing a Finite Size Representation of the Set of Approximate Solutions of an MOP [Citation Graph (, )][DBLP ] Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs