Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Journal of Heuristics

A Branch and Bound Method via d.c. Optimization Algorithms andEllipsoidal Technique for Box Constrained Nonconvex Quadratic Problems

Journal of Global Optimization

A Polyhedral Approach for Nonconvex Quadratic Programming Problemswith Box Constraints

Journal of Global Optimization

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

Journal of Global Optimization

Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems

Journal of Global Optimization

Greedy Detection

Journal of VLSI Signal Processing Systems

Modelling competitive Hopfield networks for the maximum clique problem

Computers and Operations Research

Ellipsoidal Approach to Box-Constrained Quadratic Problems

Journal of Global Optimization

Best ellipsoidal relaxation to solve a nonconvex problem

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001

Applications of global optimization and dynamical systems to prediction of epileptic seizures

Quantitative neuroscience

A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem

Journal of Global Optimization

Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming

Computational Optimization and Applications

Payoff-Monotonic Game Dynamics and the Maximum Clique Problem

Neural Computation

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

Computing

Box-constrained quadratic programs with fixed charge variables

Journal of Global Optimization

Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem

Informatica

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization

Global equilibrium search applied to the unconstrained binary quadratic optimization problem

Optimization Methods & Software

Simple and fast surrogate constraint heuristics for the maximum independent set problem

Journal of Heuristics

Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem

Discrete Applied Mathematics

Global optimality conditions for quadratic 0-1 optimization problems

Journal of Global Optimization

Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems

International Journal of Metaheuristics

Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems

International Journal of Metaheuristics

Linear and quadratic programming approaches for the general graph partitioning problem

Journal of Global Optimization

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem

Journal of Global Optimization

An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs

Journal of Global Optimization

On the approximate solution of a class of large discrete quadratic programming problems by ΔΣ modulation: the case of circulant quadratic forms

IEEE Transactions on Signal Processing

Global optimality conditions and optimization methods for quadratic integer programming problems

Journal of Global Optimization

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

Computers and Operations Research

Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs

SIAM Journal on Optimization

Polynomial unconstrained binary optimisation-part 2

International Journal of Metaheuristics

A study of memetic search with multi-parent combination for UBQP

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization

An exact solution method for unconstrained quadratic 0---1 programming: a geometric approach

Journal of Global Optimization

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

Operations Research Letters

Complexity of uniqueness and local search in quadratic 0-1 programming

Operations Research Letters

Computational aspects of the maximum diversity problem

Operations Research Letters

A new linearization technique for multi-quadratic 0-1 programming problems

Operations Research Letters

A multilevel algorithm for large unconstrained binary quadratic optimization

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Particle Algorithms for Optimization on Binary Spaces

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special Issue on Monte Carlo Methods in Statistics

On characterization of maximal independent sets via quadratic optimization

Journal of Heuristics

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

Journal of Heuristics

Probabilistic GRASP-Tabu Search algorithms for the UBQP problem

Computers and Operations Research

A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming

Applied Soft Computing