✦ LIBER ✦

Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

✍ Scribed by Da-chuan Xu; Shu-zhong Zhang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semidefinite relaxation bounds for bi-qu

✍ Xinzhen Zhang; Chen Ling; Liqun Qi 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 255 KB

Semidefinite programming relaxations for

✍ Igor Dukanovic; Franz Rendl 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 245 KB

A finite branch-and-bound algorithm for

✍ Samuel Burer; Dieter Vandenbussche 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

Computational experience with a bundle a

✍ Ilse Fischer; Gerald Gruber; Franz Rendl; Renata Sotirov 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 195 KB

Dual Bounds and Optimality Cuts for All-

✍ Ivo Nowak 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 132 KB

An improved lower bound and approximatio

✍ Cheng Lu; Zhenbo Wang; Wenxun Xing 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 204 KB