In computer science, artificial intelligence, and mathematical optimization, a heuristic is a technique designed for solving a problem more quickly… (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

- David Pisinger, Stefan Ropke
- Computers & OR
- 2007

We present a unified heuristic, which is able to solve five diff erent variants of the vehicle routing problem: the vehicle… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Trey Smith, Reid G. Simmons
- UAI
- 2004

We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We present a technique for evaluating the usability and effectiveness of ambient displays. Ambient displays are abstract and… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Richard S. Barr, Bruce L. Golden, James P. Kelly, Mauricio G. C. Resende, William R. Stewart
- J. Heuristics
- 1995

This report discusses the design of computational experiments to test heuristic methods and provides reporting guidelines for… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Usama M. Fayyad, Keki B. Irani
- IJCAI
- 1993

Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Jakob Nielsen
- CHI
- 1992

Usability specialists were better than non-specialists at performing heuristic evaluation, and “double experts” with specific… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Fred Glover
- INFORMS Journal on Computing
- 1989

This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Daniel Dominic Sleator, Robert E. Tarjan
- Commun. ACM
- 1985

In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear… (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher
- Math. Program.
- 1978

Let N be a finite set and z be a real-valued function defined on the set of subsets of N that satisfies z(S)+z(T)>-z(SUT)+z(SnT… (More)

Is this relevant?

Highly Cited

1968

Highly Cited

1968

- Peter E. Hart, Nils J. Nilsson, Bertram Raphael
- IEEE Trans. Systems Science and Cybernetics
- 1968

Our paper on the use of heuristic information in graph searching defined a path-finding algorithm, A*, and proved that it had two… (More)

Is this relevant?