Finding all minimal elements of a finite partially ordered set by genetic algorithm with a prescribed probability

DOI10.3934/naco.2011.1.389zbMath1252.68270OpenAlexW2315971899MaRDI QIDQ428481

Marcin Studniarski

Publication date: 22 June 2012

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2011.1.389

zbMATH Keywords

stopping criteriagenetic algorithmsMarkov chain

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Finding all minimal elements of a finite partially ordered set by genetic algorithm with a prescribed probability