arXiv (All)
open access
Dream-COP: Guiding Algorithm Discovery for Combinatorial Optimization Problems in an Experience World
Large language models (LLMs) enable algorithm discovery for combinatorial optimization problems (COPs) through iterative program generation and evaluation. A central challenge is how to organize search to discover better algorithms within a limited budget. Our key insight is that past search traject
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- LLM-Guided Program Evolution for Circle Packing: Breaking 10 Packomania Records for $28#972044
- Investigating the Potential of Using Large Language Models for Scheduling#1199634
- The AI Scientist-v2: Workshop-Level Automated Scientific Discovery via Agentic Tree Search#133422
- CodeFlowBench: A Multi-turn, Iterative Benchmark for Complex Code Generation#144281
- Fusion is the New Mutation: Bandit-Guided Evolution on Workflow Graphs#1201297
Record · ID 1467942
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive