applications of a special polynomial class of tsp
Clicks: 176
ID: 156222
2005
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.
Reader Engagement
Popular Article
30.6
/100
176 views
16 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #9 of 16 articles by views in chemnanomat
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate 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
Abstract
A hypothetical problem which we call a "buried treasure problem" is presented where the objective is to locate m objects among N fixed equi-spaced caches in order to minimize a measure of the risk of loss. The general problem is shown to be NP-hard. However, a sub problem may be solved as a special class of TSP in O (N log N) time. Several applications are noted.
| Reference Key |
jack2005yugoslavapplications
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Brimberg Jack;Korach Ephraim;Amami Mokhtar |
| Journal | chemnanomat |
| Year | 2005 |
| DOI |
10.2298/YJOR0501005B
|
| 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.