The no free lunch theorems: complexity and security
From MaRDI portal
Publication:5266850
DOI10.1109/TAC.2003.811254zbMATH Open1364.91045OpenAlexW2145886366MaRDI QIDQ5266850FDOQ5266850
David L. Pepyne, Qianchuan 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
Decision theory (91B06) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cited In (7)
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- Strategy optimization for controlled Markov process with descriptive complexity constraint
- On scheduling around large restrictive common due windows
- A new approach to discrete stochastic optimization problems
- Basic ideas for event-based optimization of Markov systems
- Constrained ordinal optimization -- a feasibility model based approach
- Implementation of Improved Grasshopper Optimization Algorithm to Solve Economic Load Dispatch Problems
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)
