Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
type: Item
instance of: scholarly article
title: Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
author: Yanyan Li
published in: CEJOR. Central European Journal of Operations Research
publication date: 2022-12-09T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7630660
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: Euclidean TSP
zbMATH Keywords: equivalent cyclic polygon
zbMATH Keywords: TSP heuristic
Wikidata QID: Q114228508
describes a project that uses: TSPLIB
describes a project that uses: R
describes a project that uses: Pyomo
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: s10100-021-00784-z
OpenAlex ID: W4200567194
cites work: Q3425132
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Q3772828
cites work: A short course in computational geometry and topology
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
cites work: Pyomo -- optimization modeling in Python
cites work: Q4845366
cites work: Classification of travelling salesman problem formulations
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Some Simple Applications of the Travelling Salesman Problem
cites work: Q3046480
cites work: Cyclic polygons and related questions
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Geometric Approaches to Solving the Traveling Salesman Problem
cites work: A comparative analysis of several asymmetric traveling salesman problem formulations
cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
cites work: An analytical comparison of different formulations of the travelling salesman problem
cites work: On the area of a polygonal linkage
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: Cyclic polygons with given edge lengths: existence and uniqueness
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
DOI: 10.1007/S10100-021-00784-Z
Recommended article: The Traveling Salesman Problem under squared Euclidean distances
Recommended article: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Recommended article: The Euclidean traveling salesman problem and a space-filling curve
Recommended article: The traveling salesman problem on a graph and some related integer polyhedra
Recommended article: On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
Recommended article: Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
Recommended article: Touring Polygons: An Approximation Algorithm
Recommended article: Euclidean travelling salesman problem with location-dependent and power-weighted edges
Recommended article: Q3346109
Recommended article: APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
description: scientific article; zbMATH DE number 7630660