The Partial Order of a Polymatroid Extreme Point

DOI10.1287/MOOR.10.3.367MaRDI QIDQ3696865zbMATH OpenOpenAlexFDO

Authors William H. Cunningham, Robert E. Bixby, Donald M. Topkis

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

convex gamesextreme pointgreedy algorithmpartial orderpolymatroidrank functionsubmodular functions

Mathematics Subject Classification ID

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

Recommendations

• An extreme point theorem for ordered polymatroids on chain orders
• Structural aspects of ordered polymatroids
• A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
• Adjacency on polymatroids
• scientific article; zbMATH DE number 3904604

Cited in

(21)

• Decomposition of submodular functions
• Testing membership in matroid polyhedra
• 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
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Paths on polymatroids
• An extreme point theorem for ordered polymatroids on chain orders
• On structures of bisubmodular polyhedra
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• A note on submodular function minimization by Chubanov's LP algorithm
• Diameter estimates for graph associahedra
• A game theoretic approach to a problem in polymatroid maximization
• A strongly polynomial algorithm for line search in submodular polyhedra
• Adjacency on polymatroids
• Finding submodularity hidden in symmetric difference
• A note on Frank's generalized polymatroids
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
• Equivalence of permutation polytopes corresponding to strictly supermodular functions
• Submodular function minimization

This page was built for publication: The Partial Order of a Polymatroid Extreme Point

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696865)