Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063): 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 / zbMATH DE Number
 
Property / zbMATH DE Number: 6597987 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
arc routing
Property / zbMATH Keywords: arc routing / rank
 
Normal rank
Property / zbMATH Keywords
 
lower/upper demand bound
Property / zbMATH Keywords: lower/upper demand bound / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial algorithm
Property / zbMATH Keywords: combinatorial algorithm / rank
 
Normal rank

Revision as of 21:04, 27 June 2023

scientific article
Language Label Description Also known as
English
Approximation algorithms for solving the constrained arc routing problem in mixed graphs
scientific article

    Statements

    Approximation algorithms for solving the constrained arc routing problem in mixed graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2016
    0 references
    combinatorial optimization
    0 references
    arc routing
    0 references
    lower/upper demand bound
    0 references
    approximation algorithm
    0 references
    combinatorial algorithm
    0 references

    Identifiers