The Partial Order of a Polymatroid Extreme Point
From MaRDI portal
Publication:3696865
DOI10.1287/moor.10.3.367zbMath0576.90070MaRDI QIDQ3696865
Donald M. Topkis, William H. Cunningham, Robert E. Bixby
Publication date: 1985
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.10.3.367
extreme point; greedy algorithm; partial order; rank function; polymatroid; convex games; submodular functions
Related Items
Two algorithms for maximizing a separable concave function over a polymatroid feasible region, Paths on polymatroids, On structures of bisubmodular polyhedra, A combinatorial algorithm minimizing submodular functions in strongly polynomial time.