Miu Cost Tensions (Q3735408): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cost flows in regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic flows in regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of group flows in regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: An “out-of-kilter” algorithm for solving minimum cost potential problems / rank
 
Normal rank

Latest revision as of 15:02, 17 June 2024

scientific article
Language Label Description Also known as
English
Miu Cost Tensions
scientific article

    Statements

    Miu Cost Tensions (English)
    0 references
    0 references
    1985
    0 references
    negative cut algorithm
    0 references
    shortest augmenting cut algorithm
    0 references
    capacitated network flows
    0 references
    min cost tension problem
    0 references
    totally unimodular linear programs
    0 references

    Identifiers

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