北京邮电大学主页平台管理系统 Wei Zequn--Home-- Zequn Wei, Jin-Kao Hao. Multistart solution-based tabu search for the Set-Union Knapsack Problem[J]. Applied Soft Computing, 2021, 105: 107260. (中科院一区Top)

+

博士学位

University of Angers (France)

Recommended MA Supervisor

Personal Information:

Gender:Male
E-Mail:

VIEW MORE

Other Contact Information:

email :

Home > Scientific Research > Paper Publications

Zequn Wei, Jin-Kao Hao. Multistart solution-based tabu search for the Set-Union Knapsack Problem[J]. Applied Soft Computing, 2021, 105: 107260. (中科院一区Top)

Release time:2025-03-14 Hits:

Translation or Not:no

Pre One:Liwen Li, Zequn Wei, Jin-Kao Hao, Kun He. Probability learning based tabu search for the budgeted maximum coverage problem[J]. Expert Systems with Applications, 2021: 115310. (中科院一区Top)

Next One:Zequn Wei, Jin-Kao Hao. Kernel based tabu search for the Set-union Knapsack Problem[J]. Expert Systems with Applications, 2021, 165: 113802. (中科院一区Top)