𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Three efficient algorithms for counting problems

✍ Scribed by Alberto Bertoni; Giancarlo Mauri; Mauro Torelli

Book ID
113162101
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
536 KB
Volume
8
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient Algorithms for Problems with F
Efficient Algorithms for Problems with Friction
✍ HΓΌeber, S.; Matei, A.; Wohlmuth, B. I. πŸ“‚ Article πŸ“… 2007 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 466 KB
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