Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440): 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: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6633540 / rank
 
Normal rank
Property / zbMATH Keywords
 
line-traveling repairman problem
Property / zbMATH Keywords: line-traveling repairman problem / rank
 
Normal rank
Property / zbMATH Keywords
 
optimal schedules
Property / zbMATH Keywords: optimal schedules / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity analysis
Property / zbMATH Keywords: complexity analysis / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-bound
Property / zbMATH Keywords: branch-and-bound / rank
 
Normal rank

Revision as of 02:39, 28 June 2023

scientific article
Language Label Description Also known as
English
Solving the traveling repairman problem on a line with general processing times and deadlines
scientific article

    Statements

    Solving the traveling repairman problem on a line with general processing times and deadlines (English)
    0 references
    0 references
    6 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    line-traveling repairman problem
    0 references
    optimal schedules
    0 references
    complexity analysis
    0 references
    branch-and-bound
    0 references