Polyhedral results for a class of cardinality constrained submodular minimization problems

DOI10.1016/j.disopt.2015.07.005zbMath1387.90167OpenAlexW1849826302MaRDI QIDQ1751219

Shabbir Ahmed, Jiajin Yu

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.07.005

zbMATH Keywords

cutting planescardinality constraintsubmodular minimizationconic integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (8)

Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ On distributionally robust chance constrained programs with Wasserstein distance ⋮ An exact cutting plane method for \(k\)-submodular function maximization ⋮ Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems ⋮ Sequence independent lifting for a set of submodular maximization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing a class of submodular utility functions
• Polymatroids and mean-risk minimization in discrete optimization
• The submodular knapsack polytope
• Stochastic spanning tree problem
• Convex combinatorial optimization
• Sequence independent lifting in mixed integer programming
• Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations
• Integrating facility location and production planning decisions
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Capacitated warehouse location model with risk pooling
• Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
• Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
• Maximizing Classes of Two-Parameter Objectives Over Matroids
• The facility location problem with general cost functions
• Submodular Function Minimization under Covering Constraints
• Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
• Exact Algorithms for Combinatorial Optimization Problems with Submodular Objective Functions
• Probabilistic Set Covering with Correlations
• Optimal Inequalities in Probability Theory: A Convex Optimization Approach
• Benchmarking optimization software with performance profiles.

This page was built for publication: Polyhedral results for a class of cardinality constrained submodular minimization problems