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

Convex optimization approach to a single quadratically constrained quadratic minimization problem

โœ Scribed by Maziar Salahi

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
136 KB
Volume
18
Category
Article
ISSN
1435-246X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Constrained neural approaches to quadrat
Constrained neural approaches to quadratic assignment problems
โœ S. Ishii; M. Sato ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 167 KB

In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP

A lower bound for a constrained quadrati
A lower bound for a constrained quadratic 0โ€“1 minimization problem
โœ Alain Billionnet; Alain Faye ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 659 KB

Given a quadratic pseudo-Boolean function f (x 1, . , XJ written as a multilinear polynomial in its variables, Hammer et al. [7] have studied, in their paper "Roof duality, complementation and persistency in quadratic 0-I optimization", the greatest constant c such that there exists a quadratic posi