A Min--Max Theorem for Bisubmodular Polyhedra
From MaRDI portal
Publication:4337721
DOI10.1137/S0895480194264344zbMath0873.52012MaRDI QIDQ4337721
Publication date: 26 May 1997
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27) Convex functions and convex programs in convex geometry (52A41) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization, The membership problem in jump systems, On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra, A polyhedral approach to bisubmodular function minimization, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Characterizations of the set of integer points in an integral bisubmodular polyhedron, Submodular function minimization, On structures of bisubmodular polyhedra, Signed ring families and signed posets, 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
