𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear algorithm for renaming a set of clauses as a Horn set

✍ Scribed by Jean-Jacques Hébrard

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
357 KB
Volume
124
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for minimal degree linear C
An algorithm for minimal degree linear Chebyshev approximation on a discrete set
✍ F. D. K. Roberts 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 779 KB

## Abstract An algorithm for computing a linear Chebyshev approximation to a function defined on a finite set of points is presented. The method requires the accuracy of the approximation to be specified, and determines the least degree approximation which achieves this accuracy. The algorithm is b

A steepest edge active set algorithm for
A steepest edge active set algorithm for solving sparse linear programming problems
✍ S. W. Sloan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations