๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational experience on four algorithms for the hard clustering problem

โœ Scribed by Khaled S. Al-Sultana; M. Maroof Khan

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
942 KB
Volume
17
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computational experience with approximat
Computational experience with approximation algorithms for the set covering problem
โœ Tal Grossman; Avishai Wool ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 722 KB

The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith

Numerical Experiments on Compact Computa
Numerical Experiments on Compact Computational Schemes for Solving the First Biharmonic Problem in Rectangles
โœ Aristides Th. Marinos ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 666 KB

Compact computational schemes for the first biharmonic problem in a rectangle \(a \times b\) with fourth- and second-order truncation errors and expressed in matrix form are presented. The matrix formulation of the fourth-order schemes is based on a kind of \((p, q, r, s)\) noncoupled approach which