A no free lunch theorem for multi-objective optimization

DOI10.1016/J.IPL.2010.07.026zbMATH Open1379.68180OpenAlexW4231410837MaRDI QIDQ1675754FDOQ1675754

Authors: Travis Service 

Publication date: 3 November 2017

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

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

Recommendations

• No free lunch theorem: a review
• scientific article; zbMATH DE number 1975089
• A no-free-lunch theorem for non-uniform distributions of target functions
• A ``no free lunch tutorial: sharpened and focused no free lunch
• Simple explanation of the no free lunch theorem of optimization

zbMATH Keywords

combinatorial optimizationanalysis of algorithmsmulti-objective optimizationno free lunch

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Cites Work

• On classes of functions for which no free lunch results hold
• A ``no free lunch tutorial: sharpened and focused no free lunch
• Title not available (Why is that?)

Cited In (9)

• Simple explanation of the no free lunch theorem of optimization
• Simple explanation of the no-free-lunch theorem and its implications
• Title not available (Why is that?)
• DTCSMO: an efficient hybrid starling murmuration optimizer for engineering applications
• LCAHA: a hybrid artificial hummingbird algorithm with multi-strategy for engineering applications
• CGKOA: an enhanced Kepler optimization algorithm for multi-domain optimization problems
• No free lunch theorem: a review
• A no-free-lunch theorem for non-uniform distributions of target functions
• An enhanced hybrid arithmetic optimization algorithm for engineering applications

This page was built for publication: A no free lunch theorem for multi-objective optimization

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