SPROUT

Description : This package includes the Julia code of the SPROUT algorithms [1] for submodular maximization problem. SPROUT employs greedy-based search algorithms to solve the submodular maximization problem under the intersection of matroid and knapsack constraints. README file is included in the package, showing how to use the code.

References: [1] Yu-Ran Gu, Chao Bian, and Chao Qian. Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI'23), Washington, DC, 2023

ATTN: This package is free for academic usage. You can run it at your own risk. For other purposes, please contact Dr. Chao Qian (qianc@lamda.nju.edu.cn).

Requirement: The package was developed with Julia.

ATTN2: This package was developed by Mr. Yu-Ran Gu(guyr@lamda.nju.edu.cn). For any problem concerning the code, please feel free to contact Mr. Gu.

Download: code (3MB)