arXiv (All)
open access
Differentiable Repairability & Mutations for Scalable Combinatorial Optimization
Combinatorial optimization problems such as Maximum Independent Set (MIS) and Maximum Cut (MaxCut) arise across a wide range of applications, yet solving large-scale instances remains computationally challenging. While discrete local-search procedures can produce high-quality solutions, their inhere
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
- Multilevel iterated tabu search for the multi-constraint graph partitioning problem#231626
- Graph Homomorphisms and Universal Algebra#1109003
- Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow#1104731
- Investigating layer-selective transfer learning of quantum approximate optimization algorithm parameters for the Max-Cut problem#1358899
- Formulating Multistage Cutting Stock Problems as QUBO#1083546
Record · ID 1296417
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