Submodular function minimization and polarity
From MaRDI portal
Publication:2097629
DOI10.1007/s10107-020-01607-wzbMath1506.90273arXiv1912.13238OpenAlexW3125292313MaRDI QIDQ2097629
Vishnu Narayanan, Atamtürk, Alper
Publication date: 14 November 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.13238
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorics in computer science (68R05) Artificial intelligence (68T99)
Related Items
A note on the implications of approximate submodularity in discrete optimization, Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints, Supermodularity and valid inequalities for quadratic optimization with indicators, Special issue: Global solution of integer, stochastic and nonconvex optimization problems, Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
- The indefinite zero-one quadratic problem
- Polymatroids and mean-risk minimization in discrete optimization
- Submodular function minimization
- A faster strongly polynomial time algorithm for submodular function minimization
- Submodularity and valid inequalities in capacitated fixed charge networks
- The ellipsoid method and its consequences in combinatorial optimization
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- Submodular functions and optimization.
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- Maximizing Non-monotone Submodular Functions
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Minimizing a Submodular Function on a Lattice
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Maximizing a Class of Utility Functions Over the Vertices of a Polytope
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
