arXiv AI By Hai Xia, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider

LLM-Guided Graph Generation for Structure-Based Local Improvement Methods

Read the original on arXiv AI →

arXiv:2608. 13333v1 Announce Type: new Abstract: Large neighborhood search normally selects a random subset of decision variables for iterative optimization.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Aug 19

Synthesizing Feature Extractors: An Agentic Approach for Algorithm Selection

The paper introduces an automated method that employs Large Language Models in a check–fix–verify loop to generate executable Python scripts for extracting problem-specific features from constraint satisfaction problems. Given a MiniZinc model and instance, the LLM agent produces code that builds a typed graph representation and computes structural properties such as graph density, variable clustering, and constraint tightness. Evaluated on vehicle routing, car sequencing, and fixed‑length error‑correcting codes, the synthesized extractors enable algorithm selectors that outperform expert‑curated mzn2feat features and transformer‑based trans2feat variants, while remaining interpretable.

By Hai Xia, Carlos Ans\'otegui, Stefan Szeider
Hugging Face Trending Papers
Aug 20

Learning Early-to-Final Solution Consistency for MILP Acceleration

Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making. Owing to their NP-hardness, however, modern solvers may struggle to find high-quality solutions for challenging MILP instances within practical time limits.