𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems

✍ Scribed by André Berger; Ojas Parekh

Publisher
Springer
Year
2011
Tongue
English
Weight
172 KB
Volume
62
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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