no code implementations • ICCV 2021 • Weihan Chen, Peisong Wang, Jian Cheng
Finally, based on the above simplification, we show that the original problem can be reformulated as a Multiple-Choice Knapsack Problem (MCKP) and propose a greedy search algorithm to solve it efficiently.