Constraint generation approaches for submodular function maximization leveraging graph properties

DOI10.1007/s10898-023-01318-4MaRDI QIDQ6154401

Tamás Vinkó, Eszter Julianna Csókás

Publication date: 15 February 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

integer programmingcombinatorial optimizationsubmodular function maximization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximization of submodular functions: theory and enumeration algorithms
• An improved branch \& bound method for the uncapacitated competitive location problem
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A new greedy strategy for maximizing monotone submodular function under a cardinality constraint
• A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
• 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

This page was built for publication: Constraint generation approaches for submodular function maximization leveraging graph properties