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

Authors

194

  1. PH
    Patrik Haslum

    Australian National University, Australia

    7 publications · 186 citations

    7

    h-index

  2. ST
    Sylvie Thiébaux

    Australian National University, Australia

    4 publications · 114 citations

    4

    h-index

  3. ES
    Enrico Scala

    University of Brescia, Italy

    4 publications · 116 citations

    4

    h-index

  4. HY
    Hong-Hsu Yen

    Shih Hsin University, Taiwan

    3 publications · 44 citations

    3

    h-index

  5. MK
    Michael Katz

    Technion – Israel Institute of Technology, Israel

    3 publications · 58 citations

    3

    h-index

1–5 of 194

Venues

  1. Computers & Operations Research

    7 publications · 398 citations

    7

    h-index

  2. European Journal of Operational Research

    5 publications · 332 citations

    5

    h-index

  3. Journal of Artificial Intelligence Research

    JAIR · 4 publications · 103 citations

    4

    h-index

  4. 4

    h-index

  5. Annals of Operations Research

    3 publications · 127 citations

    3

    h-index

1–5