The no free lunch theorems: complexity and security

DOI10.1109/TAC.2003.811254MaRDI QIDQ5266850zbMATH OpenOpenAlexFDO

Authors David L. Pepyne, Yu-Chi Ho, Qianchuan Zhao

Publication date 20 June 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2003.811254

Mathematics Subject Classification ID

Decision theory (91B06) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Cited in

(7)

• A new approach to discrete stochastic optimization problems
• An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
• Implementation of improved grasshopper optimization algorithm to solve economic load dispatch problems
• Strategy optimization for controlled Markov process with descriptive complexity constraint
• On scheduling around large restrictive common due windows
• Basic ideas for event-based optimization of Markov systems
• Constrained ordinal optimization -- a feasibility model based approach

This page was built for publication: The no free lunch theorems: complexity and security

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