Euclidean TSP between two nested convex obstacles (Q1041790): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient special case algorithms for the n-line planar traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The convex-hull-and-line traveling salesman problem: A solvable case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4064159 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The n-line traveling salesman problem / rank | |||
Normal rank | |||
Revision as of 05:38, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Euclidean TSP between two nested convex obstacles |
scientific article |
Statements
Euclidean TSP between two nested convex obstacles (English)
0 references
4 December 2009
0 references
computational geometry
0 references
traveling salesman problem
0 references
convex analysis
0 references
network flow
0 references
