Evolutionary Computation in Combinatorial Optimization
From MaRDI portal
Publication:5706002
DOI10.1007/B107115zbMATH Open1119.68438OpenAlexW1533372799MaRDI QIDQ5706002FDOQ5706002
Authors: Hisashi Handa
Publication date: 10 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b107115
Recommendations
- Advances in estimation of distribution algorithms
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- A Survey on Estimation of Distribution Algorithms
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- Repairing normal EDAs with selective repopulation
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cited In (5)
- Advances in estimation of distribution algorithms
- Title not available (Why is that?)
- Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
- Experimental comparisons with respect to the usage of the promising relations in EDA-based causal discovery
- Title not available (Why is that?)
This page was built for publication: Evolutionary Computation in Combinatorial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706002)