Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847)

From MaRDI portal
Revision as of 16:00, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7242695
Language Label Description Also known as
English
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
scientific article; zbMATH DE number 7242695

    Statements

    Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 September 2020
    0 references
    approximation algorithms
    0 references
    traveling salesman problem
    0 references
    constrained optimization
    0 references

    Identifiers