A no free lunch theorem for multi-objective optimization

DOI10.1016/J.IPL.2010.07.026zbMath1379.68180OpenAlexW4231410837MaRDI QIDQ1675754

Travis C. 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

zbMATH Keywords

multi-objective optimizationcombinatorial optimizationanalysis of algorithmsno free lunch

Mathematics Subject Classification ID

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

Related Items (3)

An enhanced hybrid arithmetic optimization algorithm for engineering applications ⋮ LCAHA: a hybrid artificial hummingbird algorithm with multi-strategy for engineering applications ⋮ DTCSMO: an efficient hybrid starling murmuration optimizer for engineering applications

Cites Work

• On classes of functions for which no free lunch results hold
• Unnamed Item
• Unnamed Item

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