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

Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning.

Evolutionary computation - 1 Jan 2000

Merz P, Freisleben B

Abstract excerpt

The fitness landscape of the graph bipartitioning problem is investigated by performing a search space analysis for several types of graphs. The analysis shows that the structure of the search space is significantly different for the types of instances studied. Moreover, with increasing epistasis...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Biological Evolution
Share to Computer Simulation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Models, Biological

Share to Models, Genetic

Share to Mutation

Share to Statistics as Topic

Source

Identifiers

PMID: 10753231
DOI: 10.1162/106365600568103

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 4 Sept 2026. Prepared record publication-10753231-2026-09-04.2. Manifest publication-graph-cohort-2026-09-04.2.

Source receipt: PubMed via Helena Literature Corpus, retrieved 4 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning.PMID 10753231Read ↗

On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.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 ↗

Beautiful Mind: a meta-heuristic algorithm for generating minimal covering arraySemantic proximity Read ↗

A study of fitness distance correlation as a difficulty measure in genetic programming.Semantic proximity Read ↗

Toward evolutionary graphs with two sexes: a kin selection analysis of a sex allocation problem.Semantic proximity Read ↗

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

Design of graph-based evolutionary algorithms: a case study for chemical process networks.Semantic proximity Read ↗

Genetic Programming with Tabu List for Dynamic Flexible Job Shop Scheduling.Semantic proximity Read ↗

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

Cover-Encodings of Fitness Landscapes.Semantic proximity Read ↗

A genetic model: analysis and application to MAXSAT.Semantic proximity Read ↗

An Effective Evolutionary Hybrid for Solving the Permutation Flowshop Scheduling Problem.Semantic proximity Read ↗

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