Multitasking Pareto optimization for shared monotone submodular functions with distinct knapsack constraints produces small Pareto fronts that allow solution transfer, delivering (1-1/e) approximations for all problems with improved expected runtime over separate executions.
On the use of matching algorithms to transfer solutions for the travelling salesperson problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Analysis of Multitasking Pareto Optimization for Monotone Submodular Problems
Multitasking Pareto optimization for shared monotone submodular functions with distinct knapsack constraints produces small Pareto fronts that allow solution transfer, delivering (1-1/e) approximations for all problems with improved expected runtime over separate executions.