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

DOI10.1016/J.EJOR.2006.08.005zbMATH Open1123.90067OpenAlexW2585305412MaRDI QIDQ877664FDOQ877664

Authors: F. 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

Recommendations

• Runtime analysis of evolutionary algorithms for the depth restricted \((1,2)\)-minimum spanning tree problem
• Foundations of Genetic Algorithms
• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

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)

Cites Work

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

Cited In (26)

• Fixed-parameter evolutionary algorithms and the vertex cover problem
• Analysis of solution quality of a multiobjective optimization-based evolutionary algorithm for knapsack problem
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front
• Plateaus can be harder in multi-objective optimization
• Computing minimum cuts by randomized search heuristics
• Evolutionary computation in combinatorial optimization
• Exact algorithms for bi-objective ring tree problems with reliability measures
• Dynamic and static simulated annealing for solving the multi-objective k-minimum spanning tree problem
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II)
• A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design
• Evolutionary algorithms and matroid optimization problems
• Runtime analysis of evolutionary algorithms for the depth restricted \((1,2)\)-minimum spanning tree problem
• On Geometric Set Cover for Orthants
• Illustration of fairness in evolutionary multi-objective optimization
• Foundations of Genetic Algorithms
• Analysis of a simple evolutionary algorithm for the multiobjective shortest path 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
• On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• Runtime analysis of a multi-objective evolutionary algorithm for obtaining finite approximations of Pareto fronts
• Relations, models and a memetic approach for three degree-dependent spanning tree problems
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877664)