Experiments in quadratic 0-1 programming

Construction of test problems in quadratic bivalent programming

ACM Transactions on Mathematical Software (TOMS)

Global Optimization Techniques for Solving the General Quadratic Integer Programming Problem

Computational Optimization and Applications

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

Greedy Detection

Journal of VLSI Signal Processing Systems

Recognizing Objects Using Color-Annotated Adjacency Graphs

Shape, Contour and Grouping in Computer Vision

Modelling competitive Hopfield networks for the maximum clique problem

Computers and Operations Research

The bundle method for hard combinatorial optimization problems

Combinatorial optimization - Eureka, you shrink!

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

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

Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs

Optimization Methods & Software - GLOBAL OPTIMIZATION

A neuro-GA approach for the maximum fuzzy clique problem

ICONIP'08 Proceedings of the 15th international conference on Advances in neuro-information processing - Volume Part I

Integer programming

Algorithms and theory of computation handbook

Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs

SIAM Journal on Optimization

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

Journal of Global Optimization

Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement

Discrete Optimization

A study of the quadratic semi-assignment polytope

Discrete Optimization

On the number of local maxima in quadratic 0-1 programs

Operations Research Letters

A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope

Operations Research Letters

The expected relative error of the polyhedral approximation of the max-cut problem

Operations Research Letters

Rapid Screening Procedures for Zero-One Optimization via Simulation

INFORMS Journal on Computing

On characterization of maximal independent sets via quadratic optimization

Journal of Heuristics