Metraipolis › archive › dc_191065fbfdf5
Polynomially Solvable Cases of the Quadratic Binary Optimization Problem with a Fixed Cardinality Constraint — arXiv:2610.41560
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41560
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T05:43:18.652Z
- SHA-256 of the archived text
c386b68bf9a2c4551cc07e91851147d0007a8f60d52a09dc311da0bf658626e5- Stable URL of this page
https://metraipolis.com/documento/dc_191065fbfdf5
How to cite
Polynomially Solvable Cases of the Quadratic Binary Optimization Problem with a Fixed Cardinality Constraint — arXiv:2610.41560 — arXiv (en), https://arxiv.org/abs/2610.41560 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_191065fbfdf5 (Metraipolis archive dc_191065fbfdf5, sha256 c386b68bf9a2c4551cc07e91851147d0007a8f60d52a09dc311da0bf658626e5)
BibTeX
@misc{dc191065fbfdf5,
title = {Polynomially Solvable Cases of the Quadratic Binary Optimization Problem with a Fixed Cardinality Constraint — arXiv:2610.41560},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41560},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_191065fbfdf5; sha256 c386b68bf9a2c4551cc07e91851147d0007a8f60d52a09dc311da0bf658626e5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41560. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quadratic Unconstrained Binary Optimization (QUBO) problems and their variant with a fixed cardinality constraint are both well-known NP-hard problems. While certain structural properties of the cost matrix can make some QUBO instances solvable in polynomial time, this advantage typically disappears once a cardinality constraint is added. In this work, we investigate specific structural conditions on the cost matrix under which the constrained version-quadratic binary optimization with a fixed cardinality-remains tractable. 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.41560 — 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.169Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).