A note on the implications of approximate submodularity in discrete optimization

DOI10.1007/s11590-022-01890-wOpenAlexW4281914687MaRDI QIDQ2678995

Taewoo Lee, Temitayo Ajayi, Andrew J. Schaefer

Publication date: 18 January 2023

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

Full work available at URL: https://doi.org/10.1007/s11590-022-01890-w

zbMATH Keywords

valid inequalitiesapproximate submodularityset function extensions

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Is submodularity testable?
• Polymatroids and mean-risk minimization in discrete optimization
• Valid inequalities for mixed integer linear programs
• The submodular knapsack polytope
• Discrete convex analysis
• Submodular functions and electrical networks
• Strong formulations for conic quadratic optimization with indicator variables
• Submodular function minimization and polarity
• Functional Analysis in Asymmetric Normed Spaces
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Reducibility among Combinatorial Problems
• Submodularity in Conic Quadratic Mixed 0–1 Optimization
• Learning with Submodular Functions: A Convex Optimization Perspective

This page was built for publication: A note on the implications of approximate submodularity in discrete optimization