Cite
HARVARD Citation
Lin, G. et al. (2019). A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem. Expert systems with applications. pp. 201-211. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Lin, G. et al. (2019). A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem. Expert systems with applications. pp. 201-211. [Online].