Researchers have developed a novel method for generating challenging instances for optimization problems, treating instance creation as an optimization task itself. This approach uses a black-box optimizer to search for instances that maximize solver running time, requiring only the solver, an instance encoder, and a compute budget. The method was successfully applied to four NP-hard problems, including satisfiability and the traveling salesperson problem, yielding instances significantly harder than random draws and competitive with curated benchmark sets. AI
IMPACT This method could improve the reliability of AI model evaluations by ensuring they are tested on genuinely challenging problem instances.
RANK_REASON The item is an academic paper detailing a new methodology for generating hard instances for optimization problems. [lever_c_demoted from research: ic=1 ai=1.0]
- boolean satisfiability problem
- CP Optimizer
- CP-SAT
- Hamiltonian cycle
- Hugging Face
- Nevergrad
- non-permutation flow-shop scheduling
- NP-hard problems
- SAT Competition
- travelling salesperson problem
- TSPLIB—A Traveling Salesman Problem Library
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →