A polyhedral approach to bisubmodular function minimization
From MaRDI portal
Publication:2661581
DOI10.1016/j.orl.2020.10.007OpenAlexW3095413488MaRDI QIDQ2661581
Publication date: 7 April 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.06036
Related Items (3)
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ An exact cutting plane method for \(k\)-submodular function maximization
Cites Work
- Unnamed Item
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- Polymatroids and mean-risk minimization in discrete optimization
- Pseudomatroids
- Directed submodularity, ditroids and directed submodular flows
- A two-stage stochastic programming approach for influence maximization in social networks
- Undesirable facility location with minimal covering objectives
- On structures of bisubmodular polyhedra
- A characterization of bisubmodular functions
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Greedy algorithm and symmetric matroids
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Min--Max Theorem for Bisubmodular Polyhedra
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Bisubmodular Function Minimization
This page was built for publication: A polyhedral approach to bisubmodular function minimization
