Rational solutions of the graphsack problem (Q3315278)

From MaRDI portal
Revision as of 17:59, 3 September 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
Rational solutions of the graphsack problem
scientific article

    Statements

    Rational solutions of the graphsack problem (English)
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    constraints with tree structure
    0 references
    polynomially bounded algorithms
    0 references
    binary linear optimization
    0 references
    optimal network design
    0 references
    rational graphsack problems
    0 references
    compressed solutions
    0 references
    augmenting cuts
    0 references
    optimality criterion
    0 references
    efficient algorithm
    0 references