Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519)

From MaRDI portal
Revision as of 11:06, 21 August 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
Upper and lower bounding procedures for the minimum caterpillar spanning problem
scientific article

    Statements

    Upper and lower bounding procedures for the minimum caterpillar spanning problem (English)
    0 references
    0 references
    0 references
    0 references
    19 July 2013
    0 references
    caterpillar trees
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references

    Identifiers