𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Elimination methods in the m × n sequencing problem

✍ Scribed by Wlodzimierz Szwarc

Publisher
John Wiley and Sons
Year
1971
Tongue
English
Weight
500 KB
Volume
18
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to solve the m × n assignme
An algorithm to solve the m × n assignment problem in expected time O(mn log n)
✍ Richard M. Karp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The

Vector sequence accelerator for solving
Vector sequence accelerator for solving problems in computational electromagnetics using the method of moments
✍ Surendra Singh; Ritu Singh 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract The solution of an integral equation using the method of moments leads to a system of linear equations. The resulting system of equations can be solved by direct and iterative methods. This paper introduces an iterative method utilizing Brezinski's θ algorithm. The algorithm has previou