Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.

Evolutionary computation - 3 Jun 2024

Bossek Jakob, Grimme Christian

Abstract excerpt

We contribute to the efficient approximation of the Pareto-set for the classical NP-hard multiobjective minimum spanning tree problem (moMST) adopting evolutionary computation. More precisely, by building upon preliminary work, we analyze the neighborhood structure of Pareto-optimal spanning trees and design several highly biased sub-graph-based mutation operators founded on the gained insights. In a nutshell,...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Computational Biology
Share to Computer Simulation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Mutation

Source

Identifiers

PMID: 37290030
DOI: 10.1162/evco_a_00335

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-07.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.PMID 37290030Read ↗

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives.Semantic proximity Read ↗

Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning.Semantic proximity Read ↗

Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.Semantic proximity Read ↗

Fitness Probability Distribution of Bit-Flip Mutation.Semantic proximity Read ↗

On Proportions of Fit Individuals in Population of Mutation-Based Evolutionary Algorithm with Tournament Selection.Semantic proximity Read ↗

Socio-inspired Evolutionary Algorithms: A Unified Framework and SurveySemantic proximity Read ↗

Borg: an auto-adaptive many-objective evolutionary computing framework.Semantic proximity Read ↗

Optimization by hierarchical mutant production.Semantic proximity Read ↗

Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search.Semantic proximity Read ↗

On the Performance of Different Genetic Programming Approaches for the SORTING Problem.Semantic proximity Read ↗

A genetic engineering approach to genetic algorithms.Semantic proximity Read ↗

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.