Pages that link to "Item:Q1250163"
From MaRDI portal
The following pages link to The Euclidean traveling salesman problem is NP-complete (Q1250163):
Displayed 50 items.
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles (Q1754047) (← links)
- On the r,s-SAT satisfiability problem and a conjecture of Tovey (Q1822964) (← links)
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation (Q1823875) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- On the complexity of path problems in properly colored directed graphs (Q1928492) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches (Q1974282) (← links)
- Travelling salesman problem in tissue P systems with costs (Q1983010) (← links)
- Fractal dimension and lower bounds for geometric problems (Q2039303) (← links)
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
- Synchronized pickup and delivery problems with connecting FIFO stack (Q2056913) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- An exploration of combinatorial testing-based approaches to fault localization for explainable AI (Q2163858) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Optimizing flight trajectory of UAV for efficient data collection in wireless sensor networks (Q2220849) (← links)
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension (Q2243777) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Minimizing data collection latency with unmanned aerial vehicle in wireless sensor networks (Q2279744) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP (Q2369122) (← links)
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension (Q2396378) (← links)
- Cyclic-routing of unmanned aerial vehicles (Q2424667) (← links)
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (Q2441587) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Boundary properties of the satisfiability problems (Q2450928) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- An new self-organizing maps strategy for solving the traveling salesman problem (Q2497623) (← links)
- Computing shortest heterochromatic monotone routes (Q2517794) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← links)
- Special cases of travelling salesman problems and heuristics (Q2639760) (← links)
- Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem (Q2688704) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio (Q2839206) (← links)
- Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
- The Shortest Separating Cycle Problem (Q2971152) (← links)
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
- The Length of Elements in Free Solvable Groups (Q3141280) (← links)
- Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency (Q3381954) (← links)
- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (Q3448843) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)