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

Solving quadratic distance problems: an LMI-based approach

โœ Scribed by Chesi, G.; Garulli, A.; Tesi, A.; Vicino, A.

Book ID
118259904
Publisher
IEEE
Year
2003
Tongue
English
Weight
817 KB
Volume
48
Category
Article
ISSN
0018-9286

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving quadratic assignment problems wi
Solving quadratic assignment problems with rectangular distances and integer programming
โœ Robert F. Love; Jsun Y. Wong ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 304 KB

## Abstract The problem considered involves the assignment of __n__ facilities to __n__ specified locations. Each facility has a given nonnegative flow from each of the other facilities. The objective is to minimize the sum of transportation costs. Assume these __n__ locations are given as points

An algorithm for solving quadratic netwo
An algorithm for solving quadratic network flow problems
โœ N. Boland; C.J. Goh; A.I. Mees ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 333 KB

We describe a new algorithm for solving separable quadratic cost network programming problems and compare its performance with that of the convex simplex method for networks.