a hybrid heuristic for solving the triangulation problem

Clicks: 184
ID: 230655
2010
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #33 of 42 articles by views in isprs annals of the photogrammetry, remote sensing and spatial information sciences

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
The 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 local search.<br /><br />
Reference Key
pintea2010brain:a Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Camelia Mihaela Pintea;Gloria Cerasela Crisan
Journal isprs annals of the photogrammetry, remote sensing and spatial information sciences
Year 2010
DOI
DOI not found
URL
http://brain.edusoft.ro/index.php/brain/article/view/53
Keywords
ant colony optimization computer science diseases of the nervous systemelectronic computers

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.