北京邮电大学主页平台管理系统 Wei Zequn--Home-- Multistart solution-based tabu search for the Set-Union Knapsack Problem

Home > Scientific Research > Paper Publications

Multistart solution-based tabu search for the Set-Union Knapsack Problem

Release time:2021-10-08 Hits:

Journal:Applied Soft Computing
Indexed by:Journal paper
First Author:Zequn Wei
Correspondence Author:Jin-kao Hao*
Document Type:J
Volume:105
Page Number:107260 (中科院二区Top)
Translation or Not:no
Date of Publication:2021-07-01
Included Journals:SCI

Pre One:Probability learning based tabu search for the budgeted maximum coverage problem

Next One:Kernel based tabu search for the Set-union Knapsack Problem

Home

Scientific Research

Teaching Research

Awards and Honours

Enrollment Information

Student Information

My Album

Blog

Recommended MA Supervisor

Personal Information:

Other Contact Information:

Multistart solution-based tabu search for the Set-Union Knapsack Problem