Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
From MaRDI portal
Publication:2103946
DOI10.1007/S10100-021-00784-ZOpenAlexW4200567194WikidataQ114228508 ScholiaQ114228508MaRDI QIDQ2103946FDOQ2103946
Authors: Yanyan Li 
Publication date: 9 December 2022
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-021-00784-z
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
- The traveling salesman problem. A computational study.
- TSPLIB—A Traveling Salesman Problem Library
- An analytical comparison of different formulations of the travelling salesman problem
- Integer Programming Formulation of Traveling Salesman Problems
- Title not available (Why is that?)
- Solution of a Large-Scale Traveling-Salesman Problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- On the area of a polygonal linkage
- The traveling salesman problem: An overview of exact and approximate algorithms
- The Euclidean traveling salesman problem is NP-complete
- Some Simple Applications of the Travelling Salesman Problem
- The traveling salesman. Computational solutions for RSP applications
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- Classification of travelling salesman problem formulations
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- Title not available (Why is that?)
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- Geometric Approaches to Solving the Traveling Salesman Problem
- A short course in computational geometry and topology
- Title not available (Why is that?)
- Cyclic polygons and related questions
- Pyomo -- optimization modeling in Python
- Cyclic polygons with given edge lengths: existence and uniqueness
Cited In (1)
Uses Software
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)
