𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem

✍ Scribed by Alain Billionnet; Sourour Elloumi

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
148 KB
Volume
109
Category
Article
ISSN
0025-5610

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.

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