Pages that link to "Item:Q1343140"
From MaRDI portal
The following pages link to Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140):
Displaying 7 items.
- On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
- Branch-and-cut algorithms for the covering salesman problem (Q6050582) (← links)
- A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
- The generalized close enough traveling salesman problem (Q6113445) (← links)
- Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)