Pages that link to "Item:Q5704854"
From MaRDI portal
The following pages link to TSP with neighborhoods of varying size (Q5704854):
Displaying 25 items.
- Algorithms for interval structures with applications (Q388095) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- On the total perimeter of homothetic convex bodies in a convex container (Q747571) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- On the complexity of approximating TSP with neighborhoods and related problems (Q853644) (← links)
- Cooperative TSP (Q982655) (← links)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Optimizing flight trajectory of UAV for efficient data collection in wireless sensor networks (Q2220849) (← links)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
- Connectivity graphs of uncertainty regions (Q2408099) (← links)
- Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
- Minimum-perimeter intersecting polygons (Q2429366) (← links)
- Computing shortest heterochromatic monotone routes (Q2517794) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Algorithms for Interval Structures with Applications (Q3004669) (← links)
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
- APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS (Q3636315) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
- Algorithms - ESA 2003 (Q5897267) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
