The Angular-Metric Traveling Salesman Problem
From MaRDI portal
Publication:4943841
DOI10.1137/S0097539796312721zbMath0941.68056MaRDI QIDQ4943841
Baruch Schieber, Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
computational complexitycombinatorial optimizationtraveling salesman problemroboticsapproximation algorithmsextremal point setsangle metric
Related Items
Minimization and maximization versions of the quadratic travelling salesman problem, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, Lower bounding procedure for the asymmetric quadratic traveling salesman problem, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, The quadratic cycle cover problem: special cases and efficient bounds, SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition, Going around in circles, A tabu search with geometry‐based sparsification methods for angular traveling salesman problems, The symmetric quadratic traveling salesman problem, Unnamed Item, Quadratic Combinatorial Optimization Using Separable Underestimators, An extended approach for lifting clique tree inequalities, Linear models and computational experiments for the quadratic TSP, A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions, Peeling meshed potatoes, Geometric and LP-based heuristics for angular travelling salesman problems in the plane, Angle-restricted tours in the plane., Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, On Covering Points with Minimum Turns, A Polyhedral Study of the Quadratic Traveling Salesman Problem, Minimum Scan Cover with Angular Transition Costs
