A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q178718
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexander Schrijver / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035575256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Partial Order of a Polymatroid Extreme Point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing membership in matroid polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding feasible vectors of Edmonds-Giles polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4761871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Maximal “Polymatroidal” Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Closure of a Graph and Applications to Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing symmetric submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection Problem of Shared Fixed Costs and Network Flows / rank
 
Normal rank

Revision as of 18:09, 4 June 2024

scientific article
Language Label Description Also known as
English
A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
scientific article

    Statements

    Identifiers

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