Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114228508, #quickstatements; #temporary_batch_1707161894653
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10100-021-00784-z / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: R / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pyomo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10100-021-00784-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4200567194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short course in computational geometry and topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pyomo -- optimization modeling in Python / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of travelling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Simple Applications of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic polygons and related questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Approaches to Solving the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the area of a polygonal linkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic polygons with given edge lengths: existence and uniqueness / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10100-021-00784-Z / rank
 
Normal rank

Latest revision as of 01:52, 17 December 2024

scientific article
Language Label Description Also known as
English
Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
scientific article

    Statements

    Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (English)
    0 references
    0 references
    9 December 2022
    0 references
    traveling salesman problem
    0 references
    Euclidean TSP
    0 references
    equivalent cyclic polygon
    0 references
    TSP heuristic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers