✦ LIBER ✦

Probabilistic algorithms and straight-line programs for some rank decision problems

✍ Scribed by Oscar H. Ibarra; Shlomo Moran; Louis E. Rosier

Book ID: 113162298
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 713 KB
Volume: 12
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90019-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unsolvability of some algorithmic proble

Unsolvability of some algorithmic problems for straight-line programs

✍ D. V. Shiryaev 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 441 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

Probabilistic ideas in heuristic algorit

Probabilistic ideas in heuristic algorithms for solving some scheduling problems

✍ I. Gertsbach 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 583 KB

Generic algorithms for some decision pro

Generic algorithms for some decision problems on fasciagraphs and rotagraphs

✍ Marwane Bouznif; Julien Moncel; Myriam Preissmann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 345 KB

Conical algorithms for solving a concave

Conical algorithms for solving a concave programming problem and some generalizations

✍ S.L. Utkin; V.R. Khachaturov; H. Tuy 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 490 KB

A Branch and Bound Algorithm for Solving

A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems

✍ Hiroshi Konno; Kenji Fukaishi 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 244 KB