Dual greedy polyhedra, choice functions, and abstract convex geometries (Q2386212): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2004.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964613426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: K-submodular functions and convexity of their Lovász extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of convex geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular linear programs on forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core of ordered submodular cost games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the rooted connectivity of a digraph by one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Kelso and Crawford's Gross Substitutes Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for convex geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice functions and abstract convex geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural aspects of ordered polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice functions over a finite set: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Class of Greedily Solvable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599348 / rank
 
Normal rank

Latest revision as of 15:29, 10 June 2024

scientific article
Language Label Description Also known as
English
Dual greedy polyhedra, choice functions, and abstract convex geometries
scientific article

    Statements

    Dual greedy polyhedra, choice functions, and abstract convex geometries (English)
    0 references
    0 references
    22 August 2005
    0 references
    0 references
    Dual greedy algorithm
    0 references
    Choice function
    0 references
    Convex geometry
    0 references
    Submodularity
    0 references
    0 references