arXiv (All)
open access
A Parallel Heuristic for the Fixed Cardinality Binary Quadratic Program
The Fixed Cardinality Binary Quadratic Program (FCBQP) is an optimization problem that requires a prescribed number of variables to take the value 1. We propose a parallel CPU-based heuristic that combines impact-based variable selection, tabu search, guided restarts, and a shared elite pool. Comput
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
- QUBO Sampling for Mixed Binary Quadratic Programming without Continuous Variable Binarization#1116378
- The impact of using different choice functions when solving CSPs with autonomous search#935621
- Bilevel programming for generating discrete representations in multiobjective optimization#955430
- Optimization#209941
- A characterization of efficiently compilable constraint languages#927083
Record · ID 1534718
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