Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation

DOI10.1007/s10100-021-00784-zOpenAlexW4200567194WikidataQ114228508 ScholiaQ114228508MaRDI QIDQ2103946

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

zbMATH Keywords

traveling salesman problemEuclidean TSPequivalent cyclic polygonTSP heuristic

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• R
• TSPLIB
• Gurobi
• Pyomo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the area of a polygonal linkage
• Classification of travelling salesman problem formulations
• A comparative analysis of several asymmetric traveling salesman problem formulations
• An analytical comparison of different formulations of the travelling salesman problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• The Euclidean traveling salesman problem is NP-complete
• The traveling salesman. Computational solutions for RSP applications
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A short course in computational geometry and topology
• Cyclic polygons with given edge lengths: existence and uniqueness
• Integer Programming Formulation of Traveling Salesman Problems
• Cyclic polygons and related questions
• TSPLIB—A Traveling Salesman Problem Library
• Some Simple Applications of the Travelling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Geometric Approaches to Solving the Traveling Salesman Problem
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Pyomo -- optimization modeling in Python
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints

This page was built for publication: Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation