Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
Algorithmic Prompt-Augmentation for Efficient LLM-Based Heuristic Design for A* Search
Thomas Bömer, Nico Koltermann, Max Disselnmeyer +2
Heuristic functions are essential to the performance of tree search algorithms such as A*, where their accuracy and efficiency directly impact search outcomes. Traditionally, such…
cs.AI2025
Leveraging Large Language Models to Develop Heuristics for Emerging Optimization Problems
Thomas Bömer, Nico Koltermann, Max Disselnmeyer +2
Combinatorial optimization problems often rely on heuristic algorithms to generate efficient solutions. However, the manual design of heuristics is resource-intensive and constrain…