Pages that link to "Item:Q1343140"

The following pages link to Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140):

Displaying 49 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 longest spanning tree with neighborhoods (Q777263) (← 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)
• Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← 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)
• Approximation schemes for the generalized traveling salesman problem (Q1744982) (← 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)
• The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
• Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
• Building bridges between convex regions (Q1873160) (← links)
• Routing for unmanned aerial vehicles: touring dimensional sets (Q2076917) (← links)
• Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
• Spatial coverage in routing and path planning problems (Q2083923) (← links)
• A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance (Q2147130) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
• On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
• Connectivity graphs of uncertainty regions (Q2408099) (← links)
• Minimum-perimeter intersecting polygons (Q2429366) (← links)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
• The Generalized Covering Salesman Problem (Q2815466) (← links)
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
• The Shortest Separating Cycle Problem (Q2971152) (← links)
• Coverage path planning algorithms for agricultural field machines (Q3394266) (← links)
• Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← 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)
• BALANCED PARTITION OF MINIMUM SPANNING TREES (Q4818586) (← links)
• TRAVELING SALESMAN PROBLEM OF SEGMENTS (Q4818594) (← links)
• THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE (Q4903631) (← links)
• The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
• An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
• 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)
• 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)