A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
AbstractThe Triangulation Problem consists in finding a simultaneous permutation of rows and columns of a given square matrix, so that the sum of the upper-diagonal entries is maximal. The researchers study this problem intensively, as it has major applications in broad domains. A new hybrid Ant Colony Optimization algorithm is introduced. The algorithm starts with a greedy search procedure. It is followed by an improved version of the Ant Colony System mixed with a problem-specific localdoi:10.6084/m9.figshare.5478490 fatcat:2pews6d7sjcphl2ddvctsyevam