Minimization and maximization versions of the quadratic travelling salesman problem
From MaRDI portal
Publication:5277951
DOI10.1080/02331934.2016.1276905zbMath1375.90265OpenAlexW2582342290MaRDI QIDQ5277951
Rostislav Staněk, Anja Fischer, Alexander Pilz, Frank Fischer, Ulrich Pferschy, J. Fabian Meier, Aichholzer Oswin
Publication date: 12 July 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1276905
computational experimentstravelling salesman problemturning anglebitangentsubtour elimination constraint
Related Items (6)
SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition ⋮ An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem ⋮ A tabu search with geometry‐based sparsification methods for angular traveling salesman problems ⋮ 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 ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
Uses Software
Cites Work
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- On minimum reload cost cycle cover
- An extended approach for lifting clique tree inequalities
- Linear models and computational experiments for the quadratic TSP
- Applications of a semi-dynamic convex hull algorithm
- Bipartite embeddings of trees in the plane
- The traveling salesman. Computational solutions for RSP applications
- Generating subtour elimination constraints for the TSP from pure integer solutions
- 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
- On minimum reload cost paths, tours, and flows
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
- The Angular-Metric Traveling Salesman Problem
- Traveling Salesperson Problems for the Dubins Vehicle
- An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope
- How Good Are Sparse Cutting-Planes?
This page was built for publication: Minimization and maximization versions of the quadratic travelling salesman problem
