Solving unconstrained binary quadratic programming problem by global equilibrium search
From MaRDI portal
Publication:464982
DOI10.1007/s10559-011-9368-5zbMath1298.90065MaRDI QIDQ464982
J. Herrera, D. Rodríguez-Gómez
Publication date: 30 October 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-011-9368-5
computational experiment; binary quadratic programming; approximate methods; comparative analysis of algorithms; global equilibrium search