Pages that link to "Item:Q1343140"
From MaRDI portal
The following pages link to Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140):
Displaying 16 items.
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- Controlled mobility in stochastic and dynamic wireless networks (Q373450) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Cooperative TSP (Q982655) (← links)
- A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
- Bi-objective data gathering path planning for vehicles with bounded curvature (Q1652333) (← links)
- Scheduling last-mile deliveries with truck-based autonomous robots (Q1653394) (← links)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles (Q1754047) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
- Mind the gap: a study of tube tour (Q1761218) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
