On Tightly Bounding the Dubins Traveling Salesman's Optimum

Satyanarayana G. Manyam, S. R. (2016). On Tightly Bounding the Dubins Traveling Salesman's Optimum.

Type

Unclassified

Intellectual base

Unclassified

Year

2016

DOI

10.1115/1.4039099

Link

https://doi.org/10.1115/1.4039099

Cited by

1 citation across 1 artifact.

Domain-specific

• Set TSP problem
  • … constraint, closed connected tour and subtour elimination, total-cost objective, ordinary TSP singleton special case, reductions and approximation assumptions and solution witness are explicit. to An applied instance preserves the invariant under changed notation, scale, dataset, jurisdiction, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:395c7e7af248 · see in the full table