Skip to search formSkip to main contentSkip to account menu

Heuristic

Known as: HEURISTIC SEARCH, Heuristo, Huristic 
A heuristic technique (/hjᵿˈrɪstᵻk/; Ancient Greek: εὑρίσκω, "find" or "discover"), often called simply a heuristic, is any approach to problem… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
1999
Review
1999
Recently, a number of algorithms inspired by the foraging behavior of ant colonies have been applied to the solution of difficult… 
Highly Cited
1999
Highly Cited
1999
This chapter contains sections titled: Combinatorial Optimization, The ACO Metaheuristic, How Do I Apply ACO?, Other… 
Highly Cited
1997
Highly Cited
1997
A new heuristic approach for minimizing possiblynonlinear and non-differentiable continuous spacefunctions is presented. By means… 
Review
1993
Review
1993
Part 1 Introduction: combinatorial problems local and global optima heuristics. Part 2 Simulated annealing: the basic method… 
Highly Cited
1990
Highly Cited
1990
Introduction Resources and Inspirations Heuristic Concepts, Processes, and Validation Research Design and Methodology Examples of… 
Highly Cited
1985
Highly Cited
1985
In this paper we present a 2-approximation algorithm for the k-center problem with triangle inequality. This result is “best… 
Highly Cited
1980
Highly Cited
1980
In Experiment 1, subjects read a persuasive message from a likable or unlikable communicator who presented six or two arguments… 
Highly Cited
1970
Highly Cited
1970
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to… 
Highly Cited
1968
Highly Cited
1968
Although the problem of determining the minimum cost path through a graph arises naturally in a number of interesting… 
Highly Cited
1963
Highly Cited
1963
The linear programing algorithms available for optimizing the routing of shipments in multi-plant, multi-destination systems…