𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear programming for the 0–1 quadratic knapsack problem

✍ Scribed by Alain Billionnet; Frédéric Calmels

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
852 KB
Volume
92
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new linearization technique for multi-
A new linearization technique for multi-quadratic 0–1 programming problems
✍ Wanpracha Chaovalitwongse; Panos M Pardalos; Oleg A Prokopyev 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 205 KB

We consider the reduction of multi-quadratic 0-1 programming problems to linear mixed 0-1 programming problems. In this reduction, the number of additional continuous variables is O(kn) (n is the number of initial 0-1 variables and k is the number of quadratic constraints). The number of 0-1 variabl