Metraipolis › archive › dc_52223a7cbc62
A Parallel Heuristic for the Fixed Cardinality Binary Quadratic Program — arXiv:2610.41546
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41546
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T07:57:45.616Z
- SHA-256 of the archived text
5b7caefa0abb5cffcefe040097c0c390aa084db8ef869e2862befbfdd0c4956a- Stable URL of this page
https://metraipolis.com/documento/dc_52223a7cbc62
How to cite
A Parallel Heuristic for the Fixed Cardinality Binary Quadratic Program — arXiv:2610.41546 — arXiv (en), https://arxiv.org/abs/2610.41546 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_52223a7cbc62 (Metraipolis archive dc_52223a7cbc62, sha256 5b7caefa0abb5cffcefe040097c0c390aa084db8ef869e2862befbfdd0c4956a)
BibTeX
@misc{dc52223a7cbc62,
title = {A Parallel Heuristic for the Fixed Cardinality Binary Quadratic Program — arXiv:2610.41546},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41546},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_52223a7cbc62; sha256 5b7caefa0abb5cffcefe040097c0c390aa084db8ef869e2862befbfdd0c4956a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41546. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Computational experiments on 342 benchmark instances from the maximum dispersion problem, k-clique problem, and minimum graph bisection problem show that the new algorithm is competitive and can reach best-known or reference values on instances with more than 20000 variables within one minute. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.41546 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T07:41:45.710Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).