Tag
HeurEvo introduces an automated plan–code–component co-evolution framework in which AI agents jointly evolve algorithmic structure, executable implementations, and a shared pool of reusable components for hybrid solver-augmented heuristics. Across combinatorial optimization benchmarks and MIPLIB instances, it matches or surpasses state-of-the-art solvers under tight runtime budgets and sets new results on problems such as hexagon packing.
Proposes a method to generate portfolios of optimization models using LLMs, with theoretical guarantees and empirical validation.
Matt Godbolt explores compiler optimizations that convert an O(n) summation loop into an O(1) closed-form solution, highlighting how Clang and GCC employ sophisticated techniques like loop unrolling and mathematical simplification to dramatically improve code performance.