Relaxation-based Heuristics
Relaxation-Based Heuristics is a heuristic function derived from a simplified version of the original problem obtained by removing or loosening constraints, thereby making the problem easier to solve while providing an admissible estimate of the cost to reach a goal state.
89
Publications
4K
Citations
194
Authors
131
Institutions
Publications per year
2017–2026
22
Parents
89
1–5 of 89
194
7
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 194
131

Australian National University
Canberra, Australia
8 h-index
24 publications
572 citations

Data61
Sydney, Australia
5 h-index
13 publications
270 citations

Saarland University
Saarbrücken, Germany
5 h-index
9 publications
163 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
5 publications
87 citations
National Central University
Taoyuan City, Taiwan
3 h-index
5 publications
285 citations
University of California, Berkeley
Berkeley, United States
3 h-index
4 publications
167 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
3 publications
339 citations

University of Freiburg
Freiburg im Breisgau, Germany
3 h-index
7 publications
80 citations
1–8 of 131
7 publications · 398 citations
7
h-index
5 publications · 332 citations
5
h-index
JAIR · 4 publications · 103 citations
4
h-index
4 publications · 74 citations
4
h-index
3 publications · 127 citations
3
h-index
1–5