A constructive proof for the induction of M-convex functions through networks (Q1383387): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Valuated matroids: A new look at the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular flow problem with a nonseparable cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection I: Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250151 / rank
 
Normal rank

Latest revision as of 12:02, 28 May 2024

scientific article
Language Label Description Also known as
English
A constructive proof for the induction of M-convex functions through networks
scientific article

    Statements

    A constructive proof for the induction of M-convex functions through networks (English)
    0 references
    26 November 1998
    0 references
    0 references
    submodular system
    0 references
    M-convex function
    0 references
    base polyhedra
    0 references
    valuated matroids
    0 references
    0 references