𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for list ranking and for solving graph problems on the hypercube

✍ Scribed by K. Ryu; J. Jaja

Book ID
126662091
Publisher
IEEE
Year
1990
Tongue
English
Weight
791 KB
Volume
1
Category
Article
ISSN
1045-9219

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient algorithms for solving rank tw
Efficient algorithms for solving rank two and rank three bilinear programming problems
✍ Yasutoshi Yajima; Hiroshi Konno πŸ“‚ Article πŸ“… 1991 πŸ› Springer US 🌐 English βš– 866 KB

Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: minimize c& + df,y + i c;x-d;y(xEX, yEY , j=l I where XC R"' and Y C RnZ are non