Linear ordering problems are combinatorial optimization problems that deal with the minimization of different functionals by finding a suitable permutation of the graph vertices. These problems are widely used and studied in many practical and theoretical applications. In this paper, we present a va
β¦ LIBER β¦
Multilevel algorithms for linear ordering problems
β Scribed by Safro, Ilya; Ron, Dorit; Brandt, Achi
- Book ID
- 115459993
- Publisher
- Association for Computing Machinery
- Year
- 2009
- Tongue
- English
- Weight
- 182 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1084-6654
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Multilevel algorithms for linear orderin
β
Safro, Ilya; Ron, Dorit; Brandt, Achi
π
Article
π
2009
π
Association for Computing Machinery
π
English
β 182 KB
Multilevel hybrid spectral element order
β
Scott, Jennifer A.
π
Article
π
2005
π
John Wiley and Sons
π
English
β 108 KB
## Abstract For frontal solvers to perform well on finiteβelement problems it is essential that the elements are ordered for a small wavefront. Multilevel element ordering algorithms have their origins in the profile reduction algorithm of Sloan but for large problems often give significantly small
Multilevel algorithms for ill-posed prob
β
J. Thomas King
π
Article
π
1992
π
Springer-Verlag
π
English
β 1011 KB
A Multilevel Algorithm for Mixed Problem
β
VerfΓΌrth, R.
π
Article
π
1984
π
Society for Industrial and Applied Mathematics
π
English
β 734 KB
Improved approximation algorithms for mu
β
A.A. Ageev
π
Article
π
2002
π
Elsevier Science
π
English
β 113 KB
Efficient local search algorithms for th
β
Celso S. Sakuraba; Mutsunori Yagiura
π
Article
π
2010
π
John Wiley and Sons
π
English
β 641 KB