Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114): 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: 90-04 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650700 / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple asymmetric traveling salesmen problem
Property / zbMATH Keywords: multiple asymmetric traveling salesmen problem / rank
 
Normal rank
Property / zbMATH Keywords
 
precedence constraints
Property / zbMATH Keywords: precedence constraints / rank
 
Normal rank
Property / zbMATH Keywords
 
sequential ordering problem
Property / zbMATH Keywords: sequential ordering problem / rank
 
Normal rank

Revision as of 06:22, 28 June 2023

scientific article
Language Label Description Also known as
English
Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
scientific article

    Statements

    Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    multiple asymmetric traveling salesmen problem
    0 references
    precedence constraints
    0 references
    sequential ordering problem
    0 references