The no free lunch theorems: complexity and security
From MaRDI portal
Publication:5266850
DOI10.1109/TAC.2003.811254zbMath1364.91045OpenAlexW2145886366MaRDI QIDQ5266850
David L. Pepyne, Qian-Chuan Zhao, Yu-Chi Ho
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
Analysis of algorithms and problem complexity (68Q25) Decision theory (91B06) Combinatorial optimization (90C27)
Related Items (7)
Strategy optimization for controlled Markov process with descriptive complexity constraint ⋮ Constrained ordinal optimization -- a feasibility model based approach ⋮ 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 ⋮ A new approach to discrete stochastic optimization problems ⋮ On scheduling around large restrictive common due windows ⋮ Basic ideas for event-based optimization of Markov systems
This page was built for publication: The no free lunch theorems: complexity and security
