✦ LIBER ✦

Experiments in quadratic 0–1 programming

✍ Scribed by F. Barahona; M. Jünger; G. Reinelt

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 498 KB
Volume: 44
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01587084

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quadratic convex reformulations for quad

Quadratic convex reformulations for quadratic 0–1 programming

✍ Marie-Christine Plateau 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 132 KB

A solvable case of quadratic 0–1 program

A solvable case of quadratic 0–1 programming

✍ Francisco Barahona 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Computer experiments on quadratic progra

Computer experiments on quadratic programming algorithms

✍ A. Ravindran; Harvey K. Lee 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 786 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

Using a Mixed Integer Quadratic Programm

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

✍ Alain Billionnet; Sourour Elloumi 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 148 KB

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