Funder
National Natural Science Foundation of China
Reference22 articles.
1. Cai, S., Hou, W., Lin, J., Li, Y., 2018. Improving local search for minimum weight vertex cover by dynamic strategies. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. pp. 1412–1418.
2. The generalized independent set problem: Polyhedral analysis and solution approaches;Colombi;European J. Oper. Res.,2017
3. A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts;Coniglio;European J. Oper. Res.,2021
4. The PACE 2019 parameterized algorithms and computational experiments challenge: The fourth iteration;Dzulfikar,2019
5. Tabu Search;Glover,1998