Lukas' Notes

Heuristic

May 01, 20261 min read

computation

Definition

Heuristic

A heuristic is an algorithmic rule or method that is designed to find a useful solution quickly, without necessarily proving that the solution is optimal or close to optimal.

For optimisation problems, a heuristic may work well on many instances, but it does not by itself give an approximation ratio.


Graph View

Backlinks

  • Admissible Heuristic
  • Approximation Algorithm
  • Consistent Heuristic
  • Constraint Satisfaction Problem
  • Davis–Putnam–Logemann–Loveland Algorithm
  • Dominant Heuristic
  • Dual Heuristic
  • Online Search
  • Optimistic Heuristic
  • Pareto Principle

Created with Quartz v4.4.0 © 2026

  • GitHub