Memory-Guided Tree Search with Cross-Branch Knowledge Transfer for LLM Solver Synthesis

In three linesMEMOIR, a memory-guided tree-search framework, automatically synthesizes solvers for combinatorial optimization using LLMs. With a two-level memory hierarchy (branch-local and global), it achieves 96.7% solution validity across 7 problems (scheduling, routing, packing), outperforming baselines by 9.2 points and reducing run-to-run validity variance by over an order of magnitude.

Summary generated by Claude — human-verified