Wird geladen...
Fast marching methods for the continuous traveling salesman problem
We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points (“cities”) in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a versio...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
National Academy of Sciences
2007
|
| Schlagworte: | |
| Online Zugang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC1783106/ https://ncbi.nlm.nih.gov/pubmed/17220271 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.0609910104 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|