An alternate formulation of the symmetric traveling salesman problem and its properties (Q1962065): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / 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: A classification of formulations for the (time-dependent) traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(99)00154-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003186772 / rank
 
Normal rank

Latest revision as of 10:17, 30 July 2024

scientific article
Language Label Description Also known as
English
An alternate formulation of the symmetric traveling salesman problem and its properties
scientific article

    Statements

    An alternate formulation of the symmetric traveling salesman problem and its properties (English)
    0 references
    0 references
    30 January 2000
    0 references
    traveling salesman problem
    0 references
    subtour elimination polytope
    0 references
    problem formulations
    0 references

    Identifiers