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

A genetic model: analysis and application to MAXSAT.

Evolutionary computation - 1 Jan 2000

Bertoni A, Campadelli P, Carpentieri M, Grossi G

Abstract excerpt

In this paper, a genetic model based on the operations of recombination and mutation is studied and applied to combinatorial optimization problems. Results are: 1. The equations of the deterministic dynamics in the thermodynamic limit (infinite populations) are derived and, for a sufficiently small mutation rate, the attractors are characterized; 2. A general approximation algorithm for combinatorial optimization...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Computer Simulation
Share to Models, Genetic

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Models, Statistical

Share to Mutation

Share to Neural Networks, Computer

Share to Recombination, Genetic

Share to Thermodynamics

Source

Identifiers

PMID: 11001553
DOI: 10.1162/106365600750078790

Provenance

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

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

A genetic model: analysis and application to MAXSAT.PMID 11001553Read ↗

An Analytical Framework for Runtime of a Class of Continuous Evolutionary Algorithms.Semantic proximity Read ↗

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism.Semantic proximity Read ↗

Chemical genetic algorithms--evolutionary optimization of binary-to-real-value translation in genetic algorithms.Semantic proximity Read ↗

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

Algebraic theory of recombination spaces.Semantic proximity Read ↗

Genetic algorithms in chemistry.Semantic proximity Read ↗

Bayesian optimization with constraints based on explanation-based learning and its application in materials researchSemantic proximity Read ↗

Fast and high precision algorithms for optimization in large-scale genomic problems.Semantic proximity Read ↗

A normed space of genetic operators with applications to scalability issues.Semantic proximity Read ↗

Group properties of crossover and mutation.Semantic proximity Read ↗

Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.Semantic proximity Read ↗

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

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