Skip to content

Sustainable Benchmarking Tool

· 0 citations · 19 references

TL;DR

This work presents a tool that implements data-driven approaches that can dynamically select a smaller number of instances that provide sufficient statistical evidence to evaluate the relative performance of a given set of solvers and makes them readily accessible to solver developers, thus enabling them to obtain swifter feedback on their ideas.

View source

Similar papers

Open access Sep 2026

Bench of Euler: A Benchmark for Evaluating the Problem-Solving Abilities of Large Language Models

Large language models (LLMs) have recently improved their problem-solving abilities and can solve complex mathematical problems with an increasing accuracy, necessitating the development of more challenging benchmarks. Over the years, the performance of LLMs on several benchmark datasets has also improved, motivating t...

Anurag Dutta, S. Priya, A. Ramamoorthy et al. · 0 citations
#natural language process... Preprint Aug 2026

AlgoWorlds: Benchmarking Tool Use for Global Optimization in Algorithmic Worlds

AlgoWorlds is introduced, a benchmark that transforms formally specified combinatorial optimization problems into partially observed decision environments with verifiable global optima, and seven leading LLMs are evaluated, including Claude Opus 4.8 and GPT-5.6 Sol.

Zi-Xiang Xu, Jiaan Wang, Fanfei Meng · 1 citation
Conference Open access Sep 2026

Bridging LLMs and SAT Solving: Automated Evolution of High-Performance Heuristics

This paper introduces AESAT (Auto-Evolving SAT solving), a novel neuro-symbolic framework designed to automatically evolve and optimize the heuristic functions of SAT solvers, and represents the first time an LLM-enhanced solver has dominated the world's premier SAT competition.

Mao Luo, Hang Ding, Chumin Li et al. · 0 citations
Preprint Aug 2026

Accelerated Genetic Programming Hyper-Heuristics for Simulation-Based Scheduling via Agentic AI

This paper presents a systematic refactoring approach using Claude agentic AI on real-world project-scheduling workloads in a high-performance computing (HPC) environment, where the agent identifies bottlenecks, implements targeted optimizations, and evaluates their effects, while the researcher retains final control.

H. Li, A. Pletzer, Yuan Tian et al. · 0 citations
Jul 2026

LLM-Guided Evolutionary Search for Constraint Model Reformulation to Improve Solver Efficiency

Combinatorial problems appear in numerous industrial applications. A common approach is to formulate these problems as declarative constraint models that can subsequently be compiled to and solved by a range of back-end solvers. Recent work shows that Large Language Models (LLMs) can produce correct models from natural...

Kostis Michailidis, Dimos Tsouros, Dang Nguyen et al. · 0 citations
Open access 2026

Simulating Sudoku Solvers: A Comparative Study of Deterministic, Probabilistic and Learning-Based Approaches

This study presents a simulation framework designed to evaluate the behavioral effectiveness of various automated solvers, and introduces AlphaSudoku, a hybrid simulation model that integrates probabilistic rules and strategic search.

Vincent Sieso, Ludivine Lasserre, A. Doncescu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.