Name
Affiliation
Papers
OLIVER SCHÜTZE
INRIA Futurs, LIFL, CNRS Bât M3, Villeneuve d'Ascq Cedex, France
66
Collaborators
Citations 
PageRank 
108
492
35.88
Referers 
Referees 
References 
794
636
599
Search Limit
100794
Title
Citations
PageRank
Year
On the efficient computation and use of multi-objective descent directions within constrained MOEAs00.342020
The Set-Based Hypervolume Newton Method for Bi-Objective Optimization.00.342020
Pareto Explorer for Solving Real World Applications00.342020
A benchmark for equality constrained multi-objective optimization30.412020
Using gradient-free local search within MOEAs for the treatment of constrained MOPs00.342020
Variation Rate - An Alternative to Maintain Diversity in Decision Space for Multi-objective Evolutionary Algorithms.00.342019
A New Hybrid Metaheuristic for Equality Constrained Bi-objective Optimization Problems.00.342019
Automatic Model Selection for Neural Networks.10.342019
Comparison of a genetic programming approach with ANFIS for power amplifier behavioral modeling and FPGA implementation00.342019
A neural network-evolutionary computational framework for remaining useful life estimation of mechanical systems.10.362019
Toward a New Family of Hybrid Evolutionary Algorithms.00.342019
On the choice of neighborhood sampling to build effective search operators for constrained MOPs10.362019
Enhanced directed search: a continuation method for mixed-integer multi-objective optimization problems00.342019
The Gradient Subspace Approximation As Local Search Engine Within Evolutionary Multi-Objective Optimization Algorithms00.342018
Gradient subspace approximation: a direct search method for memetic computing.20.412017
An Approach for the Local Exploration of Discrete Many Objective Optimization Problems.00.342017
Optimizing the location of ambulances in Tijuana, Mexico.20.432017
A hybrid evolutionary algorithm and cell mapping method for multi-objective optimization problems00.342017
Finding zeros of nonlinear functions using the hybrid parallel cell mapping method20.462016
An effective mutation operator to deal with multi-objective constrained problems: SPM00.342016
A local exploration tool for linear many objective optimization problems00.342016
Local Search is Underused in Genetic Programming.10.362016
The hypervolume based directed search method for multi-objective optimization problems.60.402016
On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front.00.342016
Including Users Preferences in the Decision Making for Discrete Many Objective Optimization Problems.00.342016
Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results130.492016
The directed search method for multi-objective memetic algorithms160.612016
A Local Search Approach to Genetic Programming for Binary Classification60.422015
The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems00.342015
Multi-objective Optimal Design of Nonlinear Controls00.342015
The Ambulance Location Problem in Tijuana, Mexico00.342015
Solving The Ambulance Location Problem In Tijuana-Mexico Using A Continuous Location Model10.352015
On the Behavior of Stochastic Local Search Within Parameter Dependent MOPs.00.342015
An Aspiration Set EMOA Based on Averaged Hausdorff Distances.70.452014
Asymmetric quadratic landscape approximation model00.342014
Evenly Spaced Pareto Fronts Of Quad-Objective Problems Using Psa Partitioning Technique70.492013
Special issue on evolutionary computing and complex systems00.342013
Directed search method for indicator-based multi-objective evolutionary algorithms00.342013
Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation.120.602013
PSA Based Multi Objective Evolutionary Algorithms.20.362012
PSA - A New Scalable Space Partition Based Selection Algorithm for MOEAs.60.482012
Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen.30.412012
Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization1333.222012
The Gradient Free Directed Search Method as Local Search within Multi-Objective Evolutionary Algorithms.20.382012
Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.80.612012
Computing the Set of Epsilon-Efficient Solutions in Multiobjective Space Mission Design.110.532011
HCS: a new local search strategy for memetic multiobjective evolutionary algorithms732.222010
A predictor corrector method for the computation of boundary points of a multi-objective optimization problem20.372010
Computing Approximate Solutions Of Scalar Optimization Problems And Applications In Space Mission Design00.342010
Computing gap free Pareto front approximations with stochastic search algorithms.280.982010
  • 1
  • 2