The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(83)90161-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032527321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4174517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: Solution of a 120-city 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: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of non-optimal arcs for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric traveling salesman problem and edge exchanges in minimal 1- trees / rank
 
Normal rank

Latest revision as of 16:09, 13 June 2024

scientific article
Language Label Description Also known as
English
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
scientific article

    Statements

    The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (English)
    0 references
    0 references
    0 references
    1983
    0 references
    edge exchanges
    0 references
    minimal 1-trees
    0 references
    elimination of variables
    0 references
    symmetric traveling salesman problem
    0 references
    implementation
    0 references
    1-tree relaxation
    0 references
    computational results
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references