A branch and bound algorithm for the maximum clique problem

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Journal of Heuristics

A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints

Journal of Global Optimization

Finding independent sets in a graph using continuous multivariable polynomial formulations

Journal of Global Optimization

Modelling competitive Hopfield networks for the maximum clique problem

Computers and Operations Research

An efficient approximation algorithm for finding a maximum clique using Hopfield network learning

Neural Computation

Optimization of a Quadratic Function with a Circulant Matrix

Computational Optimization and Applications

A tight lower bound for a special case of quadratic 0-1 programming

Computing

Global equilibrium search applied to the unconstrained binary quadratic optimization problem

Optimization Methods & Software

A global continuation algorithm for solving binary quadratic programming problems

Computational Optimization and Applications

Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver

Applied Intelligence

Measuring protein structural similarity by maximum common edge subgraphs

ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing

Capacity aware optimal activation of sensor nodes under reproduction distortion measures

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications

Research Article: Large-scale mining co-expressed genes in Arabidopsis anther: From pair to group

Computational Biology and Chemistry

A combinatorial column generation algorithm for the maximum stable set problem

Operations Research Letters

An algorithm for finding a maximum clique in a graph

Operations Research Letters

Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems

Journal of Heuristics