A Min--Max Theorem for Bisubmodular Polyhedra
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Convex functions and convex programs in convex geometry (52A41) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27)
Recommendations
Cited in
(19)- The membership problem in jump systems
- On structures of bisubmodular polyhedra
- A characterization of bisubmodular functions
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Generalized skew bisubmodularity: a characterization and a min-max theorem
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- Parametric bisubmodular function minimization and its associated signed ring family
- A polyhedral approach to bisubmodular function minimization
- scientific article; zbMATH DE number 2186837 (Why is no real title available?)
- BALANCED BISUBMODULAR SYSTEMS AND BIDIRECTED FLOWS
- The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions
- Signed ring families and signed posets
- A discrete convex min-max formula for box-TDI polyhedra
- A min-max theorem for transversal submodular functions and its implications
- Characterizations of the set of integer points in an integral bisubmodular polyhedron
- The box convolution and the Dilworth truncation of bisubmodular functions
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra
- Submodular function minimization
This page was built for publication: A Min--Max Theorem for Bisubmodular Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337721)
