Pages that link to "Item:Q3696865"
From MaRDI portal
The following pages link to The Partial Order of a Polymatroid Extreme Point (Q3696865):
Displayed 19 items.
- A note on Frank's generalized polymatroids (Q790124) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- Equivalence of permutation polytopes corresponding to strictly supermodular functions (Q947118) (← links)
- Submodular function minimization (Q995782) (← links)
- Decomposition of submodular functions (Q1053717) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- On submodular function minimization (Q1104332) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion (Q1119138) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- Paths on polymatroids (Q1196722) (← links)
- On structures of bisubmodular polyhedra (Q1814796) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- A note on submodular function minimization by Chubanov's LP algorithm (Q2010920) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
- Adjacency on polymatroids (Q3335528) (← links)
- Finding Submodularity Hidden in Symmetric Difference (Q5218436) (← links)