The Angular-Metric Traveling Salesman Problem
From MaRDI portal
Recommendations
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane
- scientific article; zbMATH DE number 1757971
- Minimization and maximization versions of the quadratic travelling salesman problem
- On the complexity of approximating TSP with neighborhoods and related problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Cited in
(29)- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
- The quadratic cycle cover problem: special cases and efficient bounds
- The symmetric quadratic traveling salesman problem
- Angle-restricted tours in the plane.
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- A polyhedral study of the quadratic traveling salesman problem
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Going around in circles
- scientific article; zbMATH DE number 1757971 (Why is no real title available?)
- An extended approach for lifting clique tree inequalities
- Minimum scan cover with angular transition costs
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- SFCDecomp: multicriteria optimized tool path planning in 3D printing using space-filling curve based domain decomposition
- Linear models and computational experiments for the quadratic TSP
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Minimization and maximization versions of the quadratic travelling salesman problem
- Peeling meshed potatoes
- On Covering Points with Minimum Turns
- Edge sparsification for geometric tour problems
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
- Acute tours in the plane
- What goes around comes around: covering tours and cycle covers with turn costs
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Noncrossing longest paths and cycles
- Noncrossing longest paths and cycles
- An improved bound for plane covering paths
This page was built for publication: The Angular-Metric Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943841)
