The traveling salesman problem with flexible coloring (Q444446): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6065742 / rank
 
Normal rank
Property / zbMATH Keywords
 
traveling salesman problem
Property / zbMATH Keywords: traveling salesman problem / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
probabilistic analysis
Property / zbMATH Keywords: probabilistic analysis / rank
 
Normal rank
Property / zbMATH Keywords
 
error bounds
Property / zbMATH Keywords: error bounds / rank
 
Normal rank

Revision as of 02:49, 30 June 2023

scientific article
Language Label Description Also known as
English
The traveling salesman problem with flexible coloring
scientific article

    Statements

    The traveling salesman problem with flexible coloring (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    traveling salesman problem
    0 references
    complexity
    0 references
    heuristics
    0 references
    probabilistic analysis
    0 references
    error bounds
    0 references

    Identifiers