An exact cutting plane method for \(k\)-submodular function maximization
From MaRDI portal
Publication:2067498
DOI10.1016/j.disopt.2021.100670zbMath1506.90236arXiv2008.00988OpenAlexW3198488979MaRDI QIDQ2067498
Publication date: 18 January 2022
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.00988
Related Items
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints ⋮ \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- Polymatroids and mean-risk minimization in discrete optimization
- A faster strongly polynomial time algorithm for submodular function minimization
- Pseudomatroids
- Directed submodularity, ditroids and directed submodular flows
- A two-stage stochastic programming approach for influence maximization in social networks
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A characterization of bisubmodular functions
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- On distributionally robust chance constrained programs with Wasserstein distance
- A polyhedral approach to bisubmodular function minimization
- Hub Location as the Minimization of a Supermodular Set Function
- Towards Minimizing k-Submodular Functions
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Improved Approximation Algorithms for k-Submodular Function Maximization
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
- Maximizing k -Submodular Functions and Beyond
- Sequence Independent Lifting for the Set of Submodular Maximization Problem
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Maximizing Bisubmodular and k-Submodular Functions
- Data Mining with Decision Trees
- Bisubmodular Function Minimization
- Understanding Machine Learning
