𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear compound algorithms for the partitioning problem

✍ Scribed by Yong He; Hans Kellerer; Vladimir Kotov

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
113 KB
Volume
47
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dual algorithms for the shortest path tr
Dual algorithms for the shortest path tree problem
✍ Pallottino, Stefano; ScutellοΏ½, Maria Grazia πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and

ON THE CONVERGENCE OF ZERO-FINDING EIGEN
ON THE CONVERGENCE OF ZERO-FINDING EIGENSOLUTION ALGORITHMS FOR SOLVING NON-LINEAR EIGENVALUE PROBLEMS
✍ MOHAMMEDI R. ABDEL-AZIZ πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 2 views

This paper presents a convergence theory for non-linear eigenvalue methods. The basic idea of these methods, which have been described by the author in an earlier paper, 1 is to apply an eigen-solver in conjunction with a zero-ΓΏnding technique for solving the non-linear eigenvalue problems. The main