✦ LIBER ✦

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem

✍ Scribed by Cheng Lu; Zhenbo Wang; Wenxun Xing

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 204 KB
Volume: 48
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-009-9504-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Algorithm for Bound and Equal

An Optimal Algorithm for Bound and Equality Constrained Quadratic Programming Problems with Bounded Spectrum

✍ Z. Dostál 📂 Article 📅 2006 🏛 Springer Vienna 🌐 English ⚖ 194 KB

An algorithm for a singly constrained cl

An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds

✍ P. M. Pardalos; N. Kovoor 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 355 KB

New algorithms for singly linearly const

New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds

✍ Yu-Hong Dai; Roger Fletcher 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 251 KB

A simplicial branch-and-bound algorithm

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs

✍ Jeff Linderoth 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 390 KB

An efficient branch and bound algorithm

An efficient branch and bound algorithm to solve the quadratic integer programming problem

✍ F. Körner 📂 Article 📅 1983 🏛 Springer Vienna 🌐 English ⚖ 333 KB

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.