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

An algorithm for indefinite integer quadratic programming

โœ Scribed by S.S. Erenguc; H.P. Benson

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
551 KB
Volume
21
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

Atmtract--We present an algorithm for finding the global minimum of an indefinite quadratic function over the integers contained in a compact, convex set. To find this minJmmn, the algorithm first transforms the problem into an equivalent problem with a separable objective function. It then uses a branch and bound search on the values of the constraints, rather than the variables, of the transformed problem.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for quadratic programming
An algorithm for quadratic programming
โœ Marguerite Frank; Philip Wolfe ๐Ÿ“‚ Article ๐Ÿ“… 1956 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 744 KB

Pr in c e t o n Un i v e r s i t y A finite iteration method for calculating the solution of quadratic Extensions to m o r e general nonprogramming problems is described.r linear Droblems a r e suggested.

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.