The ellipsoid method and its consequences in combinatorial optimization (Q1168215)

From MaRDI portal
Revision as of 07:24, 5 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q55882924, #quickstatements; #temporary_batch_1722838931121)
scientific article
Language Label Description Also known as
English
The ellipsoid method and its consequences in combinatorial optimization
scientific article

    Statements

    The ellipsoid method and its consequences in combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    submodular set function
    0 references
    Khachiyan's algorithm
    0 references
    NP hardness
    0 references
    polynomial algorithms
    0 references
    polynomial complexity
    0 references
    vertex packing in perfect graphs
    0 references
    matching
    0 references
    matroid intersection problems
    0 references
    optimum covering of directed cuts of a digraph
    0 references
    fractional chromatic number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references