Bisubmodular polyhedra, simplicial divisions, and discrete convexity
DOI10.1016/J.DISOPT.2014.02.002zbMATH Open1308.90146OpenAlexW2028404519MaRDI QIDQ2339814FDOQ2339814
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/185324
Recommendations
Combinatorial optimization (90C27) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Signed and weighted graphs (05C22) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- Discrete Convex Analysis
- Submodular functions and optimization.
- Title not available (Why is that?)
- Minimum cost flow with set-constraints
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Greedy algorithm and symmetric matroids
- Recent Developments in Discrete Convex Analysis
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Pseudomatroids
- Directed submodularity, ditroids and directed submodular flows
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- Applications of discrete convex analysis to mathematical economics
- Title not available (Why is that?)
- On structures of bisubmodular polyhedra
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure
- A Min--Max Theorem for Bisubmodular Polyhedra
- Optimal Matching Forests and Valuated Delta-Matroids
Cited In (24)
- Projection and convolution operations for integrally convex functions
- Integrality of subgradients and biconjugates of integrally convex functions
- Scaling, proximity, and optimization of integrally convex functions
- Separating subdivision of bicycle wheel inequalities over cut polytopes
- Continuous relaxation for discrete DC programming
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
- On subdivision posets of cyclic polytopes
- Discrete convexity and unimodularity. I.
- Discrete Fenchel duality for a pair of integrally convex and separable convex functions
- Directed discrete midpoint convexity
- Signed ring families and signed posets
- The invariance of weak convexity conditions of \(B\)-nets with respect to subdivision
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
- Dissection of the path-simplex in \(\mathbb {R}^n\) into \(n\) path-subsimplices
- Title not available (Why is that?)
- Recent progress on integrally convex functions
- Characterizations of the set of integer points in an integral bisubmodular polyhedron
- Monotone diameter of bisubmodular polyhedra
- Discrete Convex Functions on Graphs and Their Algorithmic Applications
- Odd Submodular Functions, Dilworth Functions and Discrete Convex Functions
- On generalized bisection of 𝑛-simplices
- Discrete 2-convex functions
- Discrete Midpoint Convexity
- On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra
This page was built for publication: Bisubmodular polyhedra, simplicial divisions, and discrete convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339814)
