Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Multiobjective heuristic search in AND/OR graphs
Journal of Algorithms
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
An updated survey of GA-based multiobjective optimization techniques
ACM Computing Surveys (CSUR)
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
SIAM Review
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th International Conference on Genetic Algorithms
Efficient information gathering on the Internet
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Evolutionary Computation
Saddles and barrier in landscapes of generalized search operators
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
A local search based barrier height estimation algorithm for DNA molecular transitions
DNA'05 Proceedings of the 11th international conference on DNA Computing
Minimum basin algorithm: an effective analysis technique for DNA energy landscapes
DNA'04 Proceedings of the 10th international conference on DNA computing
Towards multifield scalar topology based on pareto optimality
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
Hi-index | 0.00 |
Fitness landscapes have proved to be a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. Usually, a fitness landscape is considered as a mapping from a configuration space equipped with some notion of adjacency, nearness, distance, or accessibility, into the real numbers. In the context of multi-objective optimization problems this concept can be extended to poset-valued landscapes. In a geometric analysis of such a structure, local Pareto points take on the role of local minima. We show that the notion of saddle points, barriers, and basins can be extended to the poset-valued case in a meaningful way and describe an algorithm that efficiently extracts these features from an exhaustive enumeration of a given generalized landscape.