Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector (Q4846556): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Homotopy properties of greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular systems and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids and Linear Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroid greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on selectors and greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms and Ramsey properties of antimatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory / rank
 
Normal rank

Latest revision as of 15:57, 23 May 2024

scientific article; zbMATH DE number 790588
Language Label Description Also known as
English
Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector
scientific article; zbMATH DE number 790588

    Statements

    Identifiers