Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
From MaRDI portal
Publication:2103946
Recommendations
- The traveling salesman problem under squared Euclidean distances
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- The Euclidean traveling salesman problem and a space-filling curve
- The traveling salesman problem on a graph and some related integer polyhedra
- On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
- Touring polygons: an approximation algorithm
- Euclidean travelling salesman problem with location-dependent and power-weighted edges
- scientific article; zbMATH DE number 3880463
- APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
Cites work
- scientific article; zbMATH DE number 2089211 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 795217 (Why is no real title available?)
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- A short course in computational geometry and topology
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- An analytical comparison of different formulations of the travelling salesman problem
- Classification of travelling salesman problem formulations
- Cyclic polygons and related questions
- Cyclic polygons with given edge lengths: existence and uniqueness
- Geometric Approaches to Solving the Traveling Salesman Problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- On the area of a polygonal linkage
- Pyomo -- optimization modeling in Python
- Solution of a Large-Scale Traveling-Salesman Problem
- Some Simple Applications of the Travelling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- The Euclidean traveling salesman problem is NP-complete
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- The traveling salesman problem. A computational study.
- The traveling salesman problem: An overview of exact and approximate algorithms
- The traveling salesman. Computational solutions for RSP applications
This page was built for publication: Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103946)
