Transforming Constraint Programs to Input for Local Search
Summary
This paper presents a method to automatically generate local search neighborhoods from constraint specifications using symmetry properties, evaluated on six optimization problems.
Similar Articles
A Study of Parallel Continuous Local Search
This paper studies parallel Continuous Local Search (CLS) for Boolean satisfiability with pseudo-Boolean constraints, revealing that redundant constraints can inhibit convergence and that CLS shows promise as a sub-solver in hybrid settings.
Beyond Objective Equivalence: Constraint Injection for LLM-Based Optimization Modeling on Vehicle Routing Problems
Researchers from Beihang University and Baidu propose 'constraint injection,' a dual verification method for LLM-based optimization modeling that detects spurious or omitted constraints beyond objective equivalence. They develop VRPCoder, an 8B model for translating natural-language vehicle routing problems into Gurobi scripts, achieving 93% average Pass@1 and outperforming Claude Sonnet and prior OR-LLMs by large margins.
A Hybrid Nested Harness for Decoupling Structure and Parameters in LLM-Driven Optimization
This paper proposes a hybrid nested search framework that decouples structural sketching (by an LLM) from numeric parameter optimization (by traditional solvers like CMA-ES) in LLM-driven evolutionary optimization, and validates it across meta-optimization, code-based policies, and Bayesian inference tasks.
Learning Local Constraints for Reinforcement-Learned Content Generators
This paper proposes a hybrid method combining Wave Function Collapse (WFC) and reinforcement learning to generate game levels that are both visually satisfying and playable, using WFC constraints to guide the RL agent.
Latent Heuristic Search: Continuous Optimization for Automated Algorithm Design
This paper proposes Latent Heuristic Search (LHS), a framework that shifts heuristic discovery to a learned continuous latent manifold, using gradient-based optimization and normalizing flows to generate novel heuristics conditioned on large language models, achieving competitive results on TSP, CVRP, KSP, and Online Bin Packing.