65 search results - page 1 / 13 » Generating and measuring instances of hard semidefinite prog... |
MP
2010
13 years 3 months ago
2010
JSAT
2008
13 years 4 months ago
2008
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
SIAMJO
2010
12 years 11 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
ENC
2005
IEEE
13 years 10 months ago
2005
IEEE
We developed generators that produce challenging MKP instances. Our approaches uses independently exponential distributions over a wide range to generate the constraint coefficien...