The Partial Order of a Polymatroid Extreme Point

DOI10.1287/moor.10.3.367zbMath0576.90070OpenAlexW2025410044MaRDI 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

zbMATH Keywords

extreme pointgreedy algorithmpartial orderrank functionpolymatroidconvex gamessubmodular functions

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization, On submodular function minimization, Generalized polymatroids and submodular flows, Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, A strongly polynomial algorithm for line search in submodular polyhedra, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, Equivalence of permutation polytopes corresponding to strictly supermodular functions, Paths on polymatroids, Adjacency on polymatroids, A note on submodular function minimization by Chubanov's LP algorithm, Submodular function minimization, Finding Submodularity Hidden in Symmetric Difference, On structures of bisubmodular polyhedra, A note on Frank's generalized polymatroids, Decomposition of submodular functions, Diameter estimates for graph associahedra, A combinatorial algorithm minimizing submodular functions in strongly polynomial time., Testing membership in matroid polyhedra