𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semidefinite relaxations of dynamical programs under discrete constraints

✍ Scribed by Camilo Ortiz; René Meziat

Book ID
107403275
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
779 KB
Volume
4
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms and Semidefinit
Approximation Algorithms and Semidefinite Programming || Constraint Satisfaction Problems, and Relaxing Them Semidefinitely
✍ Gärtner, Bernd; Matousek, Jiri 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 257 KB

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit