✦ LIBER ✦

A Semidefinite Programming Approach to the Quadratic Knapsack Problem

✍ Scribed by C. Helmberg; F. Rendl; R. Weismantel

Book ID: 110282602
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 101 KB
Volume: 4
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1009898604624

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semidefinite Programming Relaxations for

Semidefinite Programming Relaxations for the Quadratic Assignment Problem

✍ Qing Zhao; Stefan E. Karisch; Franz Rendl; Henry Wolkowicz 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 244 KB

A semidefinite programming approach to t

A semidefinite programming approach to the generalized problem of moments

✍ Jean B. Lasserre 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 395 KB

The generalized quadratic knapsack probl

The generalized quadratic knapsack problem. A neuronal network approach

✍ Pedro M. Talaván; Javier Yáñez 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Linear programming for the 0–1 quadratic

Linear programming for the 0–1 quadratic knapsack problem

✍ Alain Billionnet; Frédéric Calmels 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Dynamic programming approaches to the mu

Dynamic programming approaches to the multiple criteria knapsack problem

✍ Kathrin Klamroth; Margaret M. Wiecek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul

From Linear to Semidefinite Programming:

From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems

✍ Frédéric Roupin 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 274 KB