arXiv subjects

Thi Thanh Tu Le

Publications and source records attributed to Thi Thanh Tu Le.

2 recordsLinked to original sources

arXiv2026

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. 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.

math.OC↗

arXiv2026

Polynomially Solvable Cases of the Quadratic Binary Optimization Problem with a Fixed Cardinality Constraint

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.

math.OC↗