A polynomial case of unconstrained zero-one quadratic optimization
From MaRDI portal
Publication:5955560
DOI10.1007/s101070100233zbMath1055.90051MaRDI QIDQ5955560
Komei Fukuda, Thomas M. Liebling, Kim Allemand, Erich Steiner
Publication date: 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100233
Related Items
Models and methods for standardization problems, New bounds on the unconstrained quadratic integer programming problem, Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm, Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, Compact linearization for binary quadratic problems, On the gap between the quadratic integer programming problem and its semidefinite relaxation