A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649)

From MaRDI portal
Revision as of 15:15, 19 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A heuristic method for solving the problem of partitioning graphs with supply and demand
scientific article

    Statements

    A heuristic method for solving the problem of partitioning graphs with supply and demand (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2016
    0 references

    Identifiers