A Note on <i>K</i>-Best Solutions to the Chinese Postman Problem (Q4277509)

From MaRDI portal
Revision as of 01:38, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 495749
Language Label Description Also known as
English
A Note on <i>K</i>-Best Solutions to the Chinese Postman Problem
scientific article; zbMATH DE number 495749

    Statements

    A Note on <i>K</i>-Best Solutions to the Chinese Postman Problem (English)
    0 references
    0 references
    0 references
    0 references
    19 February 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(K\)-best solutions
    0 references
    Chinese postman
    0 references
    time complexity
    0 references
    non-bipartite matching
    0 references
    0 references