An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
From MaRDI portal
Publication:427399
DOI10.1007/s10898-011-9713-2zbMath1268.90040WikidataQ57445446 ScholiaQ57445446MaRDI QIDQ427399
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9713-2
nonlinear integer programming; lower bounds; optimality condition; branch-and-bound method; quadratic 0--1 programming; variable fixation
Uses Software