3 search results - page 1 / 1 » The Power of Semidefinite Programming Relaxations for MAX-SA... |
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
TSP
2010
13 years 1 days ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
JMLR
2006
13 years 5 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...