Pages that link to "Item:Q1250163"

The following pages link to The Euclidean traveling salesman problem is NP-complete (Q1250163):

Displaying 50 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring (Q281797) (← links)
• A simplified NP-complete MAXSAT problem (Q293164) (← links)
• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
• On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
• The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
• A survey on single crane scheduling in automated storage/retrieval systems (Q323403) (← links)
• Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
• Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
• Alternating paths and cycles of minimum length (Q340546) (← links)
• Watchman tours for polygons with holes (Q419503) (← links)
• Equilibria, fixed points, and complexity classes (Q458480) (← links)
• A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
• Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748) (← links)
• Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
• Path optimization with limited sensing ability (Q729301) (← links)
• NP-completeness of the Hamming salesman problem (Q761246) (← links)
• Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
• A simplified NP-complete satisfiability problem (Q790612) (← links)
• Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
• Strategies for parallel unaware cleaners (Q896136) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• Cooperative TSP (Q982655) (← links)
• Optimal search with positive switch cost is NP-hard (Q1065706) (← links)
• Optimum watchman routes (Q1107312) (← links)
• Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
• Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms (Q1116908) (← links)
• Probabilistic analysis of some Euclidean clustering problems (Q1147633) (← links)
• On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I (Q1158109) (← links)
• An O(N log N) planar travelling salesman heuristic based on spacefilling curves (Q1166433) (← links)
• Watchman routes under limited visibility (Q1188285) (← links)
• The zookeeper route problem (Q1193837) (← links)
• Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
• The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749) (← links)
• Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
• The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
• The traveling salesmanpProblem for lines in the plane (Q1603540) (← links)
• Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
• Quantum annealing for combinatorial clustering (Q1617211) (← links)
• A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
• Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces (Q1675324) (← links)
• Graph-based point drift: graph centrality on the registration of point-sets (Q1677064) (← links)
• The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
• On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
• Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme (Q1701902) (← links)
• A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing (Q1730499) (← links)
• Application of imperialist competitive algorithm on solving the traveling salesman problem (Q1736616) (← links)
• Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies (Q1751911) (← links)