Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem

DOI10.1016/S0895-7177(98)00036-3zbMath0987.90059OpenAlexW2064969919MaRDI QIDQ1596747

R. Smith

Publication date: 5 May 2002

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(98)00036-3

zbMATH Keywords

maximum likelihood estimatesalmost sure convergenceasymptotic joint distributionevolutionary schemeprobabilistic heuristic

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (1)

Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem

Uses Software

• Genocop

Cites Work

• Using reliability analysis to estimate the number of generations to convergence in genetic algorithms
• Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem