An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (Q1280545): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q538438
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Zoran M. Saric / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach / 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: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem / rank
 
Normal rank

Latest revision as of 17:54, 28 May 2024

scientific article
Language Label Description Also known as
English
An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
scientific article

    Statements

    An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (English)
    0 references
    0 references
    0 references
    15 March 1999
    0 references
    generalized traveling salesman
    0 references
    heuristics
    0 references

    Identifiers