An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586)

From MaRDI portal
Revision as of 03:39, 4 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129363121, #quickstatements; #temporary_batch_1725413904772)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An exact and heuristic approach for the \(d\)-minimum branch vertices problem
scientific article

    Statements

    An exact and heuristic approach for the \(d\)-minimum branch vertices problem (English)
    0 references
    0 references
    21 December 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree
    0 references
    branch vertice
    0 references
    integer programming
    0 references
    metaheuristic
    0 references
    0 references
    0 references