Optimization, block designs and no free lunch theorems

DOI10.1016/J.IPL.2004.12.015zbMath1192.68263OpenAlexW2106525092MaRDI QIDQ1041724

Pekka Orponen, Evan J. Griffiths

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.015

zbMATH Keywords

optimizationcombinatorial problemstheory of computationcombinatorial designsno free lunch theorems

Mathematics Subject Classification ID

Mathematical programming (90C99)

Related Items (4)

An enhanced hybrid arithmetic optimization algorithm for engineering applications ⋮ LCAHA: a hybrid artificial hummingbird algorithm with multi-strategy for engineering applications ⋮ IYDSE: ameliorated Young's double-slit experiment optimizer for applied mechanics and engineering ⋮ DTCSMO: an efficient hybrid starling murmuration optimizer for engineering applications

Cites Work

• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On classes of functions for which no free lunch results hold
• A no-free-lunch theorem for non-uniform distributions of target functions
• Locally trivial t-designs and t-designs without repeated blocks
• Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
• Computer science today. Recent trends and developments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimization, block designs and no free lunch theorems