A tight linearization and an algorithm for zero-one quadratic programming problems

Structural alignment of large—size proteins via lagrangian relaxation

Proceedings of the sixth annual international conference on Computational biology

Pseudo-boolean optimization

Discrete Applied Mathematics

Selected topics on assignment problems

Discrete Applied Mathematics

Designing cost-effective content distribution networks

Computers and Operations Research

The quadratic knapsack problem-a survey

Discrete Applied Mathematics

An algorithm for the generalized quadratic assignment problem

Computational Optimization and Applications

A network approach for specially structured linear programs arising in 0-1 quadratic optimization

Discrete Applied Mathematics

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Discrete Applied Mathematics

A mathematical program to refine gene regulatory networks

Discrete Applied Mathematics

Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems

Discrete Applied Mathematics

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

Journal of Global Optimization

Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem

Computers and Operations Research

On the end-to-end flow allocation and channel assignment in multi-channel multi-radio wireless mesh networks with partially overlapped channels

Computer Communications

Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming

SIAM Journal on Optimization

Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

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

Journal of Global Optimization

A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem

INFORMS Journal on Computing

A study of the quadratic semi-assignment polytope

Discrete Optimization

Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs

Discrete Optimization

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

Operations Research Letters

Item-associated cluster assignment model on storage allocation problems

Computers and Industrial Engineering

An efficient compact quadratic convex reformulation for general integer quadratic programs

Computational Optimization and Applications