A partial Benders decomposition (PBD) for solving choice-based competitive facility location problems (CBCFLP)
-
Updated
May 17, 2024 - Julia
A partial Benders decomposition (PBD) for solving choice-based competitive facility location problems (CBCFLP)
Another blog, another platform
Randomized Greedy Learning Under Full-bandit Feedback
apricot implements submodular optimization for the purpose of selecting subsets of massive data sets to train machine learning models quickly. See the documentation page: https://apricot-select.readthedocs.io/en/latest/index.html
Code for our AISTATS '22 paper: Improving Attribution Methods by Learning Submodular Functions.
Probabilistic Gas Leak Rate Estimation using Submodular Function Maximization with Routing Constraints
delta-submodular work codes
A collection of optimization algorithms for maximizing unconstrained submodular set functions.
Personalized knowledge graph summarization based on historical queries
Routines for submodular set function minimization
A GPU accelerated Submodular Optimization toolkit.
Non-Uniform Subset Selection for Active Learning in Structured Data
Add a description, image, and links to the submodularity topic page so that developers can more easily learn about it.
To associate your repository with the submodularity topic, visit your repo's landing page and select "manage topics."