In recent years the unconstrained binary quadratic program (UBQP) has grown in
importance in the field of combinatorial optimization due to its application potential and its …

We investigate a multi-commodity capacitated facility location problem involving
sustainability concerns (eg, restrained carbon emission). In addition, this problem …

Quadratic Programming has been widely applied to solve real-world problems. This paper
describes a solution method for solving a special class of fuzzy quadratic programming …

This book is devoted to the presentation of an exact quadratic regularization method for
solving the problems of global optimization. The essence of this method is to transform …

In received signal strength target localization problems, the selection of sensor positions
involved in estimation is a crucial factor in determining the network's overall quality of …

The quadratic unconstrained binary optimization problem (QUBO) is equivalent to a number
of prominent combinatorial and discrete optimization problems and generalizes many …

Many image processing and pattern recognition problems can be formulated as binary
quadratic programming (BQP) problems. However, solving a large BQP problem with a good …

Quadratic convex reformulation is an important method for improving the performance of a
branch-and-bound based binary quadratic programming solver. In this paper, we study a …

A special reformulation-linearization technique based linear conic relaxation is proposed for
discrete quadratic programming (DQP). We show that the proposed relaxation is tighter than …

Quadratic programming (QP) is an optimization problem wherein one minimizes (or
maximizes) a quadratic function of a finite number of decision variable subject to a finite …