Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Binary Quadratic Problem"”.

  1. New results on some quadratic programming problems

    … algorithms for several special classes of quadratic programming problems. The problems we study can be classifiedinto two categories. The first group contains two optimization problems with binary constraints. To solve these problems, we first explore some intrinsic relation between binary

    uiuc Repository record for New results on some quadratic programming problems (opens in a new tab)

  2. New approximation methods for solving binary quadratic programming problem

    In this thesis, we consider a special class of binary quadratic programming problem (BQP) where the number of nonzero elements is fixed. Such problems arise frequently from various applications and have been proved to be NP-hard. After a brief review of the quadratic programming problem, several …

    uiuc Repository record for New approximation methods for solving binary quadratic programming problem (opens in a new tab)