Multitask Pareto Optimization for Monotone Submodular Problems with Dynamic Constraints
This work focuses on the case where elements within each constraint have uniform cost and shows that this structure leads to small Pareto fronts in the multitasking formulation, which enables solution sharing across tasks and can improve performance compared to running standard evolutionary approaches independently.