✦ LIBER ✦

A Tight Lower Bound for a Special Case of Quadratic 0–1 Programming

✍ Scribed by G. Palubeckis

Publisher: Springer Vienna
Year: 2006
Tongue: English
Weight: 185 KB
Volume: 77
Category: Article
ISSN: 0010-485X
DOI: 10.1007/s00607-005-0153-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On lower bounds for a class of quadratic

On lower bounds for a class of quadratic 0, 1 programs

✍ Arjang A Assad; Weixuan Xu 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 339 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

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

A tight lower bound for the worst case o

A tight lower bound for the worst case of Bottom-Up-Heapsort

✍ Rudolf Fleischer 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 569 KB

A lower bound for 0,1,∗ tournament codes

✍ Karen L. Collins; Peter W. Shor; John R. Stembridge 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 220 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