Minimum spanning trees made easier via multi-objective optimization

DOI10.1007/s11047-006-9004-xzbMath1173.90535MaRDI QIDQ862963

Frank Neumann, Ingo Wegener

Publication date: 25 January 2007

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-006-9004-x

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C29: Multi-objective and goal programming

Related Items

Variable solution structure can be helpful in evolutionary optimization, Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem, Concentration inequalities for nonlinear matroid intersection, Unnamed Item, Using multi-objective evolutionary algorithms for single-objective optimization, On the approximation ability of evolutionary optimization with application to minimum set cover, Modeling and solving the bi-objective minimum diameter-cost spanning tree problem, An analysis on recombination in multi-objective evolutionary optimization, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems, Illustration of fairness in evolutionary multi-objective optimization, Computing minimum cuts by randomized search heuristics, Plateaus can be harder in multi-objective optimization, Analysis of evolutionary algorithms for the longest common subsequence problem, Evolutionary algorithms and matroid optimization problems, Ant colony optimization and the minimum spanning tree problem, Runtime analysis of a binary particle swarm optimizer, Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints, Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem, Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms, Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization, Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On spanning tree problems with multiple objectives
• On the analysis of the \((1+1)\) evolutionary algorithm
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Genetic algorithm approach on multi-criteria minimum spanning tree problem