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

The solution of an integer quadratic programming problem

โœ Scribed by V.V. Bashurov

Publisher
Elsevier Science
Year
1966
Weight
158 KB
Volume
6
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

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