The n-line traveling salesman problem (Q3989545): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1002/net.3230220106 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145466017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Recursions Connected With Symmetric Groups I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solutions of x<sup>d</sup> = 1 In Symmetric Groups / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:08, 15 May 2024

scientific article
Language Label Description Also known as
English
The n-line traveling salesman problem
scientific article

    Statements

    The n-line traveling salesman problem (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    Euclidean traveling salesman
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references