Pages that link to "Item:Q1250163"
From MaRDI portal
The following pages link to The Euclidean traveling salesman problem is NP-complete (Q1250163):
Displayed 28 items.
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP (Q3541790) (← links)
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← links)
- The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924) (← links)
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition (Q4522112) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- Average optimal cost for the Euclidean TSP in one dimension (Q5055572) (← links)
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition (Q5104667) (← links)
- Power indices and easier hard problems (Q5751941) (← links)
- Solving the Watchman Route Problem with Heuristic Search (Q5870496) (← links)
- Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction (Q5881167) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Learn global and optimize local: a data-driven methodology for last-mile routing (Q6047849) (← links)
- Complexity of inventory routing problems when routing is easy (Q6068536) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Efficient hybrid Bayesian optimization algorithm with adaptive expected improvement acquisition function (Q6094430) (← links)
- Financial networks with singleton liability priorities (Q6104351) (← links)
- On computing optimal linear diagrams (Q6108740) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- The Approximation Ratio of the <i>k</i>-Opt Heuristic for the Euclidean Traveling Salesman Problem (Q6115413) (← links)
- A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane (Q6130875) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
- Financial networks with singleton liability priorities (Q6164510) (← links)
- Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio (Q6169113) (← links)
- Observation routes and external watchman routes (Q6179428) (← links)
- Optimal transport methods for combinatorial optimization over two random point sets (Q6193775) (← links)
- Approximation algorithms with constant factors for a series of asymmetric routing problems (Q6194441) (← links)
- Time complexity of the analyst's traveling salesman algorithm (Q6200929) (← links)