Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm

MaRDI QIDQ3115223zbMATH OpenFDO

Authors Anton Valentinovich Eremeev

Publication date 20 February 2012

zbMATH Keywords

approximate solutionapproximation schemedynamic programmingevolutionary algorithmrandomization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Evolutionary algorithms and dynamic programming
• Evolutionary computation in combinatorial optimization
• Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
• Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
• Logic versus Approximation

Cited in

(1)

• Evolutionary algorithms and dynamic programming

This page was built for publication: Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115223)