a hybrid heuristic for solving the triangulation problem
Clicks: 136
ID: 230655
2010
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Emerging Content
1.8
/100
6 views
6 readers
Trending
AI Quality Assessment
Not analyzed
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 | |
| Keywords |
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.