Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
by Daniel Karapetyan, Abraham P. Punnen
Reference:
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem (Daniel Karapetyan, Abraham P. Punnen), 2015.
Bibtex Entry:
@Unpublished{Karapetyan2015f, author = {Karapetyan, Daniel and Punnen, Abraham P.}, title = {Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem}, year = {2015}, comment = {[<a href="http://www.cs.nott.ac.uk/~pszdk/bqplib/extra_tables.pdf">Extra tables</a>] [<a href="http://www.cs.nott.ac.uk/~pszdk/bqplib/small.rar">Small instances (56 Kb)</a>] [<a href="http://www.cs.nott.ac.uk/~pszdk/bqplib/moderate.rar">Moderate instances (11 Mb)</a>] [<a href="http://www.cs.nott.ac.uk/~pszdk/bqplib/large.rar">Large instances (260 Mb)</a>] [<a href="http://www.cs.nott.ac.uk/~pszdk/bqplib/best_known_solutions.zip">Best known solutions (52 Kb)</a>]}, keywords = {heuristics; quadratic programming; 0-1 variables; neighborhoods; testbed; local search}, }