An efficient local search for large-scale set-union knapsack problem

[1]  Minghao Yin,et al.  Two Efficient Local Search Algorithms for Maximum Weight Clique Problem , 2016, AAAI.

[2]  Sanjay Silakari,et al.  Survey of Metaheuristic Algorithms for Combinatorial Optimization , 2012 .

[3]  Minghao Yin,et al.  A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs , 2018, IJCAI.

[4]  Rong Chen,et al.  Solving quantified constraint satisfaction problems with value selection rules , 2020, Frontiers of Computer Science.

[5]  Geng Lin,et al.  A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem , 2019, Expert Syst. Appl..

[6]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[7]  Steven Li,et al.  A simplified binary harmony search algorithm for large scale 0-1 knapsack problems , 2015, Expert Syst. Appl..

[8]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[9]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[10]  R. S. Sabeenian,et al.  Fabric Defect Detection in Handlooms Cottage Silk Industries using Image Processing Techniques , 2012 .

[11]  Roberto Javier Asín Achá,et al.  Anytime automatic algorithm selection for knapsack , 2020, Expert Syst. Appl..

[12]  Abdul Sattar,et al.  Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..

[13]  Ashwin Arulselvan,et al.  A note on the set union knapsack problem , 2014, Discret. Appl. Math..

[14]  Jin-Kao Hao,et al.  Iterated two-phase local search for the Set-Union Knapsack Problem , 2019, Future Gener. Comput. Syst..

[15]  Derya Birant,et al.  Interactive process miner: a new approach for process mining , 2018 .

[16]  Yingcheng Xu,et al.  Extracting core questions in community question answering based on particle swarm optimization , 2019, Data Technol. Appl..

[17]  Shaowei Cai,et al.  Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs , 2015, IJCAI.

[18]  Xizhao Wang,et al.  A novel binary artificial bee colony algorithm for the set-union knapsack problem , 2018, Future Gener. Comput. Syst..

[19]  Gai-Ge Wang,et al.  Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems , 2019, IEEE Access.

[20]  Haizhong An,et al.  The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm , 2018, Mathematics.

[21]  Jin-Kao Hao,et al.  Adaptive feasible and infeasible tabu search for weighted vertex coloring , 2018, Inf. Sci..

[22]  O. Goldschmidt,et al.  Note: On the set-union knapsack problem , 1994 .

[23]  Richard Taylor,et al.  Approximations of the Densest k-Subhypergraph and Set Union Knapsack problems , 2016, ArXiv.

[24]  Yichao He,et al.  Solving the set-union knapsack problem by a novel hybrid Jaya algorithm , 2019, Soft Computing.

[25]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[26]  Adil Baykasoglu,et al.  A swarm intelligence-based algorithm for the set-union knapsack problem , 2019, Future Gener. Comput. Syst..

[27]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[28]  Yi-Chao He,et al.  Estimation of Distribution Algorithm Based on Lévy Flight for Solving the Set-Union Knapsack Problem , 2019, IEEE Access.

[29]  He Jiang,et al.  Compiler testing: a systematic literature analysis , 2018, Frontiers of Computer Science.

[30]  Shaowei Cai,et al.  Towards faster local search for minimum weight vertex cover on massive graphs , 2019, Inf. Sci..

[31]  Dong Yue,et al.  Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem , 2019, Eur. J. Oper. Res..

[32]  Manuel Laguna,et al.  Tabu Search , 1997 .

[33]  Gilbert Laporte,et al.  Perturbation heuristics for the pickup and delivery traveling salesman problem , 2002, Comput. Oper. Res..

[34]  Laura Carrea,et al.  An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters , 2016, Eur. J. Oper. Res..

[35]  Michael Poss,et al.  Robust combinatorial optimization with knapsack uncertainty , 2017, Discret. Optim..

[36]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.