Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Local optimum

Known as: Local optima, Local optimality, Locally optimal 
In applied mathematics and computer science, a local optimum of an optimization problem is a solution that is optimal (either maximal or minimal… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
  • M. Laguna
  • Handbook of Heuristics
  • 2018
  • Corpus ID: 2867322
From the Publisher: This book explores the meta-heuristics approach called tabu search, which is dramatically changing our… Expand
  • table 1.1
  • figure 1.1
  • figure 1.2
  • figure 2.2
  • table 2.1
Highly Cited
2014
Highly Cited
2014
This work proposes a new meta-heuristic called Grey Wolf Optimizer (GWO) inspired by grey wolves (Canis lupus). The GWO algorithm… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 6
Highly Cited
2008
Highly Cited
2008
  • D. Simon
  • IEEE Transactions on Evolutionary Computation
  • 2008
  • Corpus ID: 8319014
Biogeography is the study of the geographical distribution of biological organisms. Mathematical equations that govern the… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Highly Cited
2007
Highly Cited
2007
In advanced service oriented systems, complex applications, described as abstract business processes, can be executed by invoking… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 4
Highly Cited
2004
Highly Cited
2004
In this article, we study Pareto local optimum sets for the biobjective Traveling Salesman Problem applying straightforward… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2000
Highly Cited
2000
The clonal selection algorithm is used by the natural immune system to define the basic features of an immune response to an… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1999
Highly Cited
1999
Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and… Expand
Highly Cited
1998
Highly Cited
1998
The deterministic annealing approach to clustering and its extensions has demonstrated substantial performance improvement over… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1992
Highly Cited
1992
This module accompanies the Computer Science in Economics & Management article "Simulated Annealing: An Initial Application in… Expand
  • table 1
  • table 2
  • table 4
  • table 6
  • table 8
Highly Cited
1985
Highly Cited
1985
We investigate the complexity of finding locally optimal solutions to NP-hard combinatorial optimization problems. Local… Expand