✦ LIBER ✦

A new variable reduction technique for convex integer quadratic programs

✍ Scribed by Zhongsheng Hua; Bin Zhang; Xiaoyan Xu

Book ID: 111712561
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 164 KB
Volume: 32
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2006.11.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Algorithm for Solving Strictly Con

A New Algorithm for Solving Strictly Convex Quadratic Programs

✍ Li, Wu; Swetits, John 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 454 KB

Convex formulations for optimal selectio

Convex formulations for optimal selection of controlled variables and measurements using Mixed Integer Quadratic Programming

✍ Ramprasad Yelchuru; Sigurd Skogestad 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 782 KB

A new linesearch method for quadraticall

A new linesearch method for quadratically constrained convex programming

✍ A. Melman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 532 KB

A new penalty function algorithm for con

A new penalty function algorithm for convex quadratic programming

✍ M. Ben-Daya; K.S. Al-Sultan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 607 KB

In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an e

A new bound for the quadratic assignment

A new bound for the quadratic assignment problem based on convex quadratic programming

✍ Kurt M. Anstreicher; Nathan W. Brixius 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 114 KB

A new technique for generating quadratic

A new technique for generating quadratic programming test problems

✍ Paul H. Calamai; Luis N. Vicente; Joaquim J. Júdice 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 994 KB