๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming

โœ Scribed by Mauricio G. C. Resende, K. G. Ramakrishnan and Zvi Drezner

Book ID
123687821
Publisher
INFORMS
Year
1995
Tongue
English
Weight
502 KB
Volume
43
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel computational issues of an inte
Parallel computational issues of an interior point method for solving large bound-constrained quadratic programming problems
โœ M. Dโ€™Apuzzo; M. Marino ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 181 KB

This paper deals with a parallel implementation of an interior point algorithm for solving sparse convex quadratic programs with bound constraints. The parallelism is introduced at the linear algebra level. Concerning the solution of the linear system arising at each step of the considered algorithm