Topic
Heuristic
About: Heuristic is a research topic. Over the lifetime, 23100 publications have been published within this topic receiving 565299 citations. The topic is also known as: discover & heuristic function.
Papers published on a yearly basis
Papers
More filters
01 Feb 1976
TL;DR: An O(n3) heuristic algorithm is described for solving d-city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition and a worst-case analysis of this heuristic shows that the ratio of the answer obtained to the optimum TSP solution is strictly less than 3/2.
Abstract: : An O(n sup 3) heuristic algorithm is described for solving n-city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition. The algorithm involves as substeps the computation of a shortest spanning tree of the graph G defining the TSP, and the finding of a minimum cost perfect matching of a certain induced subgraph of G. A worst-case analysis of this heuristic shows that the ratio of the answer obtained to the optimum TSP solution is strictly less than 3/2. This represents a 50% reduction over the value 2 which was the previously best known such ratio for the performance of other polynomial-growth algorithms for the TSP.
1,346 citations
••
TL;DR: In this paper, a class of surrogate constraint heuristics are proposed for integer programming problems. But they are based on a simple framework that illuminates the character of several earlier heuristic proposals and provides a variety of new alternatives.
Abstract: This paper proposes a class of surrogate constraint heuristics for obtaining approximate, near optimal solutions to integer programming problems. These heuristics are based on a simple framework that illuminates the character of several earlier heuristic proposals and provides a variety of new alternatives. The paper also proposes additional heuristics that can be used either to supplement the surrogate constraint procedures or to provide independent solution strategies. Preliminary computational results are reported for applying one of these alternatives to a class of nonlinear generalized set covering problems involving approximately 100 constraints and 300–500 integer variables. The solutions obtained by the tested procedure had objective function values twice as good as values obtained by standard approaches (e.g., reducing the best objective function values of other methods from 85 to 40 on the average. Total solution time for the tested procedure ranged from ten to twenty seconds on the CDC 6600.
1,326 citations
•
01 Jan 1990
TL;DR: Introduction Resources and Inspirations Heuristic Concepts, Processes, and Validation Research Design and Methodology Examples of Heuristic Research Applications of heuristic Research
Abstract: Introduction Resources and Inspirations Heuristic Concepts, Processes, and Validation Research Design and Methodology Examples of Heuristic Research Applications of Heuristic Research
1,304 citations
•
12 Dec 2011TL;DR: Empirical results using Thompson sampling on simulated and real data are presented, and it is shown that it is highly competitive and should be part of the standard baselines to compare against.
Abstract: Thompson sampling is one of oldest heuristic to address the exploration / exploitation trade-off, but it is surprisingly unpopular in the literature. We present here some empirical results using Thompson sampling on simulated and real data, and show that it is highly competitive. And since this heuristic is very easy to implement, we argue that it should be part of the standard baselines to compare against.
1,296 citations