Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem

DOI10.1016/j.ejor.2006.08.005zbMath1123.90067OpenAlexW2585305412MaRDI QIDQ877664

Frank Neumann

Publication date: 3 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.005

zbMATH Keywords

evolutionary computationsexpected optimization timemulti-objective minimum spanning trees

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (15)

Plateaus can be harder in multi-objective optimization ⋮ Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) ⋮ Runtime analysis of a multi-objective evolutionary algorithm for obtaining finite approximations of Pareto fronts ⋮ Illustration of fairness in evolutionary multi-objective optimization ⋮ Computing minimum cuts by randomized search heuristics ⋮ Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front ⋮ Fixed-parameter evolutionary algorithms and the vertex cover problem ⋮ An analysis on recombination in multi-objective evolutionary optimization ⋮ Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem ⋮ Relations, models and a memetic approach for three degree-dependent spanning tree problems ⋮ Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem ⋮ On Geometric Set Cover for Orthants ⋮ Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms ⋮ A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design

Cites Work

• Unnamed Item
• Maximum of k-th maximal spanning trees of a weighted graph
• Exact arborescences, matchings and cycles
• On the spanning trees of weighted graphs
• On the analysis of the \((1+1)\) evolutionary algorithm
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Multicriteria Optimization
• STACS 2005

This page was built for publication: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem