Heuristic
Definition
A heuristic is a practical rule or estimation method intended to quickly lead to usable solutions without guaranteeing optimal results.
Heuristics use problem knowledge, approximations, or simplified rules to reduce search or decision spaces.
Simply explained
Like a good rule of thumb: often helpful but not perfect in every situation.
Why it matters in practice
Relevant for complex planning, search, and prioritization problems when full optimization is too costly.
Example from business
A ticket system initially prioritizes cases by SLA, customer, and fault type before a specialist makes fine decisions.
Limits and pitfalls
- Treating heuristics as proof; not measuring exceptions; reusing outdated rules; overlooking bias in rules.
Origin & history
NIST describes heuristics as algorithmic procedures that often deliver usable or approximately correct results. They are used, among other things, in optimization problems.
Use in mid-sized companies
- Possible applications: prioritization, scheduling, search, and rule-based preselection.
Frequently asked questions
Is a heuristic always inaccurate?
No, it can be very good but typically does not automatically guarantee the optimum. Can it be tested? Yes, against reference or optimal solutions.
Sources
- heuristic · NIST Dictionary of Algorithms and Data Structures, heuristic
Source verification: 11.10.2026.
Editorially reviewed on: