Sulabh Bansal

Orcid: 0000-0003-4993-8879

According to our database1, Sulabh Bansal authored at least 9 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Red deer algorithm to detect the secret key of the monoalphabetic cryptosystem.
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
Towards the right amount of randomness in quantum-inspired evolutionary algorithms.
Soft Comput., 2017

2016
Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems.
Swarm Evol. Comput., 2016

2015
Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems.
Memetic Comput., 2015

Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm.
J. Comput. Appl. Math., 2015

2014
Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm.
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


  Loading...