𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem

✍ Scribed by Billionnet, Alain; Soutif, Éric

Book ID
120317209
Publisher
Operations Research Society of America
Year
2004
Tongue
English
Weight
160 KB
Volume
16
Category
Article
ISSN
0899-1499

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for quadratic
An approximation algorithm for quadratic cost 0–1 mixed integer programming problems
✍ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.