On the public citation graph

Dynamic Velocity Clamping in Binary PSO with Time-Varying Transfer Function for the 0-1 Knapsack Problem

0 signed · 43 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
inferredcites →https://doi.org/10.1007/978-3-540-24777-7_9openalex-snapshot
Multidimensional Knapsack Problems
inferredcites →https://doi.org/10.1007/978-3-662-03315-9openalex-snapshot
Genetic Algorithms + Data Structures = Evolution Programs
inferredcites →https://doi.org/10.1007/s00500-019-04114-zopenalex-snapshot
Semi-supervised data clustering using particle swarm optimisation
inferredcites →https://doi.org/10.1007/s00500-020-05360-2openalex-snapshot
A novel x-shaped binary particle swarm optimization
inferredcites →https://doi.org/10.1007/s00521-022-07839-5openalex-snapshot
An Enhanced Binary Particle Swarm Optimization (E-BPSO) algorithm for service placement in hybrid cloud platforms
inferredcites →https://doi.org/10.1007/s10462-022-10328-9openalex-snapshot
A survey on binary metaheuristic algorithms and their engineering applications
inferredcites →https://doi.org/10.1007/s10489-021-02717-4openalex-snapshot
A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem
inferredcites →https://doi.org/10.1007/s11042-024-20121-1openalex-snapshot
An effective binary dynamic grey wolf optimization algorithm for the 0-1 knapsack problem
inferredcites →https://doi.org/10.1016/j.amc.2012.05.001openalex-snapshot
A Modified Binary Particle Swarm Optimization for Knapsack Problems
inferredcites →https://doi.org/10.1016/j.asoc.2017.04.050openalex-snapshot
A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO
inferredcites →https://doi.org/10.1016/j.cmpb.2023.107987openalex-snapshot
An improved binary particle swarm optimization algorithm for clinical cancer biomarker identification in microarray data
inferredcites →https://doi.org/10.1016/j.cor.2004.03.002openalex-snapshot
Where are the hard knapsack problems?
inferredcites →https://doi.org/10.1016/j.ejor.2021.12.009openalex-snapshot
A new class of hard problem instances for the 0–1 knapsack problem
inferredcites →https://doi.org/10.1016/j.ejps.2004.03.002openalex-snapshot
Modified particle swarm optimization algorithm for variable selection in MLR and PLS modeling: QSAR studies of antagonism of angiotensin II antagonists
inferredcites →https://doi.org/10.1016/j.ins.2009.12.010openalex-snapshot
Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power
inferredcites →https://doi.org/10.1016/j.knosys.2018.05.009openalex-snapshot
An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems
inferredcites →https://doi.org/10.1016/j.knosys.2018.08.003openalex-snapshot
Binary dragonfly optimization for feature selection using time-varying transfer functions
inferredcites →https://doi.org/10.1016/j.knosys.2022.109446openalex-snapshot
BMPA-TVSinV: A Binary Marine Predators Algorithm using time-varying sine and V-shaped transfer functions for wrapper-based feature selection
inferredcites →https://doi.org/10.1016/j.patrec.2019.11.017openalex-snapshot
An integrated design of particle swarm optimization (PSO) with fusion of features for detection of brain tumor
inferredcites →https://doi.org/10.1016/j.pnsc.2008.03.018openalex-snapshot
Modified binary particle swarm optimization
inferredcites →https://doi.org/10.1016/j.swevo.2012.09.002openalex-snapshot
S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
inferredcites →https://doi.org/10.1016/j.swevo.2020.100808openalex-snapshot
A particle swarm optimization algorithm for mixed-variable optimization problems
inferredcites →https://doi.org/10.1016/s0304-3975(01)00182-7openalex-snapshot
On the analysis of the (1+1) evolutionary algorithm
inferredcites →https://doi.org/10.1016/s1874-8651(08)60067-8openalex-snapshot
Solving a Class of Job-Shop Scheduling Problem based on Improved BPSO Algorithm
inferredcites →https://doi.org/10.1080/03772063.2021.1962747openalex-snapshot
Feature Selection for Alzheimer’s Gene Expression Data Using Modified Binary Particle Swarm Optimization
inferredcites →https://doi.org/10.1109/4235.985692openalex-snapshot
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
inferredcites →https://doi.org/10.1109/cec.1999.781987openalex-snapshot
Weight-codings in a genetic algorithm for the multi-constraint knapsack problem
inferredcites →https://doi.org/10.1109/icnn.1995.488968openalex-snapshot
Particle swarm optimization
inferredcites →https://doi.org/10.1109/icsmc.1997.637339openalex-snapshot
A discrete binary version of the particle swarm algorithm
inferredcites →https://doi.org/10.1109/jiot.2022.3182798openalex-snapshot
A Novel Hybrid Particle Swarm Optimization Algorithm for Path Planning of UAVs
inferredcites →https://doi.org/10.1109/jsen.2013.2290433openalex-snapshot
Task Allocation for Wireless Sensor Network Using Modified Binary Particle Swarm Optimization
inferredcites →https://doi.org/10.1109/mci.2025.3624184openalex-snapshot
Hyper-Construction: Evolving Evaluation Networks to Regulate Constructive Heuristics for 0-1 Knapsack Problem [Research Frontier]
inferredcites →https://doi.org/10.1109/tevc.2015.2503422openalex-snapshot
An Analysis of the Inertia Weight Parameter for Binary Particle Swarm Optimization
inferredcites →https://doi.org/10.1109/tpwrs.2005.860907openalex-snapshot
A Novel Approach for Unit Commitment Problem via an Effective Hybrid Particle Swarm Optimization
inferredcites →https://doi.org/10.1162/106365605774666886openalex-snapshot
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.1162/evco_r_00180openalex-snapshot
Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review
inferredcites →https://doi.org/10.1214/ss/1177011077openalex-snapshot
Simulated Annealing
inferredcites →https://doi.org/10.1287/opre.45.5.758openalex-snapshot
A Minimal Algorithm for the 0-1 Knapsack Problem
inferredcites →https://doi.org/10.3390/app131910588openalex-snapshot
Developing a New Procedural Binary Particle Swarm Optimization Algorithm to Estimate Some Properties of Local Concrete Mixtures
inferredcites →https://doi.org/10.3390/math10111929openalex-snapshot
Binary Aquila Optimizer for Selecting Effective Features from Medical Data: A COVID-19 Case Study
inferredcites →https://doi.org/10.33969/ais.2020.21003openalex-snapshot
Binary particle swarm optimization (BPSO) based channel selection in the EEG signals and its application to speller systems
inferredcites →https://doi.org/10.4304/jsw.3.9.28-35openalex-snapshot
A Novel Probability Binary Particle Swarm Optimization Algorithm and Its Application
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.