𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new penalty parameter for linearly constrained 0–1 quadratic programming problems

✍ Scribed by Yong Hsia, Yanping Wang

Book ID
120885479
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
192 KB
Volume
7
Category
Article
ISSN
1862-4472

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

A lower bound for a constrained quadrati
A lower bound for a constrained quadratic 0–1 minimization problem
✍ Alain Billionnet; Alain Faye 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Given a quadratic pseudo-Boolean function f (x 1, . , XJ written as a multilinear polynomial in its variables, Hammer et al. [7] have studied, in their paper "Roof duality, complementation and persistency in quadratic 0-I optimization", the greatest constant c such that there exists a quadratic posi