paper-with-me

Papers

FormuEvo: LLM-Guided Evolution for Discovering Solver-Efficient Mixed-Integer Programming Formulations

2026-08-24 · Haofeng Yuan, Jianing Peng, Jieyi Bi, Ni Zhang, Shiji Song, Zhiguang Cao arxiv

Mixed-integer programming (MIP) lies at the core of operations research and industrial optimization. While large language models (LLMs) have recently shown promise in automated MIP modeling from natural language, they prioritize semantic correctness but overlook formulation strength, severely bottlenecking the efficiency of downstream solvers. We propose FormuEvo, an LLM-guided evolutionary framework for automated discovery of solver-efficient MIP formulations. FormuEvo frames MIP formulation design as evolutionary optimization over the symbolic space of MIP formulations, represented as executable modeling programs, by iteratively generating, evaluating, and selecting stronger candidates via LLM-driven crossover, mutation, and repair operations. To move beyond blind exploration, FormuEvo introduces a solver-informed diagnosis mechanism that exploits fine-grained solver statistics as verbal gradients for targeted refinement. Additionally, a structured memory abstracts prior experience into reusable modeling strategies, avoiding redundant exploration while enabling zero-shot transfer to unseen problems and bootstrapping smaller LLMs. Experiments across diverse linear and non-linear problems demonstrate that FormuEvo discovers formulations that significantly outperform both expert-designed formulations and existing LLM-based approaches, accelerating solvers by up to 5.5$\times$, with distilled knowledge transferring effectively across problems and model scales.

📄 PDF Abstract BibTeX arXiv:2608.23353

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Discovering heuristics in a complex SAT solver with large language models

2025-07-30 · Yiwen Sun, Furong Ye, Zhihan Chen, Ke Wei 외 arxiv

The Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications. Optimizing modern SAT solvers in real-world settings is quite challenging due to their i…

Guided Self-Evolving LLMs with Minimal Human Supervision

2025-12-02 · Wenhao Yu, Zhenwen Liang, Chengsong Huang, Kishan Panaganti 외 arxiv

AI self-evolution has long been envisioned as a path toward superintelligence, where models autonomously acquire, refine, and internalize knowledge from their own learning experiences. Yet in practice, unguided self-evol…

Question Generation

EALG: Evolutionary Adversarial Generation of Language Model-Guided Generators for Combinatorial Optimization

2025-06-03 · Ruibo Duan, Yuxin Liu, Xinyao Dong, Chenglin Fan

Generating challenging instances is crucial for the evaluation and advancement of combinatorial optimization solvers. In this work, we introduce EALG (Evolutionary Adversarial Generation of Language Model-Guided Generato…

Combinatorial OptimizationLanguage ModelingLanguage Modelling

Discovering Novel Biological Traits From Images Using Phylogeny-Guided Neural Networks

2023-06-05 · Mohannad Elhamod, Mridul Khurana, Harish Babu Manogaran, Josef C. Uyeda 외

Discovering evolutionary traits that are heritable across species on the tree of life (also referred to as a phylogenetic tree) is of great interest to biologists to understand how organisms diversify and evolve. However…

Image Generation

Heuristically Guided Compilation for Multi-Agent Path Finding

2022-12-13 · Pavel Surynek

Multi-agent path finding (MAPF) is a task of finding non-conflicting paths connecting agents' specified initial and goal positions in a shared environment. We focus on compilation-based solvers in which the MAPF problem …

Multi-Agent Path Finding