Metraipolis › archive › dc_216402691daf

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-03T05:43:18.147Z
SHA-256 of the archived text
bd4c0090fe495d11824c396d195d4b55e7f2f91b17a74ec100eaa78ad0b296e5
Stable URL of this page
https://metraipolis.com/documento/dc_216402691daf

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_216402691daf (Metraipolis archive dc_216402691daf, sha256 bd4c0090fe495d11824c396d195d4b55e7f2f91b17a74ec100eaa78ad0b296e5)
BibTeX
@misc{dc216402691daf,
  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_216402691daf; sha256 bd4c0090fe495d11824c396d195d4b55e7f2f91b17a74ec100eaa78ad0b296e5},
  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-03T05:31:17.168Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).