Sulabh Bansal
Orcid: 0000-0003-4993-8879
According to our database1,
Sulabh Bansal
authored at least 9 papers
between 2009 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Soft Comput., September, 2024
2019
A Generalized Parallel Quantum Inspired Evolutionary Algorithm Framework for Hard Subset Selection Problems: A GPQIEA for Subset Selection.
Int. J. Appl. Evol. Comput., 2019
2018
An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem.
Int. J. Appl. Evol. Comput., 2018
2017
Soft Comput., 2017
2016
Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems.
Swarm Evol. Comput., 2016
2015
Memetic Comput., 2015
Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm.
J. Comput. Appl. Math., 2015
2014
Int. J. Appl. Evol. Comput., 2014
2009
Is Stochastic Ranking Really better than Feasibility Rules for Constraint Handling in Evolutionary Algorithms?
Proceedings of the World Congress on Nature & Biologically Inspired Computing, 2009