arXiv AI

An In-depth Study of LLM Contributions to the Bin Packing Problem

arXiv:2510. 27353v2 Announce Type: replace Abstract: Recent studies have suggested that Large Language Models (LLMs) could provide interesting ideas contributing to mathematical discovery.

arXiv AI
Sep 7

LLM-Guided Program Evolution for Circle Packing: Breaking 10 Packomania Records for $28

The paper introduces Discovery Loop, a lightweight system that employs a large language model (LLM) to iteratively evolve optimization algorithms for the Packomania circle‑packing benchmark. Starting from a simple seed solver, the LLM proposes algorithmic improvements guided by a scoreboard and a history of prior ideas, evaluates each candidate against an independent verifier, and retains only successful changes. Within 15 iterations and a total LLM cost of $27.72, the system broke 10 Packomania records for N between 101 and 114, improving the best known solutions by 2.4%–5.4%. The work demonstrates that a cost‑efficient, LLM‑driven approach can rapidly advance state‑of‑the‑art solutions in a complex optimization domain, suggesting broader potential for democratizing automated scientific discovery.

By Wes Sander
arXiv AI
Sep 24

Combining LLMs and Genetic Search for ARC-AGI-2

The paper presents a hybrid approach that combines large language models (LLMs) with genetic algorithms to solve ARC-AGI-2 tasks. An LLM (Qwen3.5-4B) first generates a small set of programs, which seed a genetic algorithm that evolves these programs within a domain‑specific language ensuring validity. This method yields 6 correct solutions out of 60 tasks (10%), outperforming either technique alone.

By Val Dyachenko
arXiv AI
Aug 28

LLMs Can Design Near-Optimal OR Algorithms

The paper investigates whether large language models (LLMs) can design effective algorithms for well-specified operations research (OR) problems, focusing on inventory control, queueing network control, and assortment optimization. Two usage levels are examined: (1) the model receives a single problem instance and outputs a solution, and (2) the model receives only a problem class description and returns a general algorithm mapping instance parameters to solutions. Using a single untuned prompt and a Python sandbox, the strongest tested model, gpt-5.6-sol, matches or surpasses existing methods on nearly all evaluated instances, even when the algorithm is fixed before seeing evaluation cases, and performance improves markedly across models released within eight months.

By Jackie Baek