On the public citation graph
A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems
0 signed · 63 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4419-1306-7openalex-snapshot
Matheuristics: Hybridizing Metaheuristics and Mathematical Programming
inferredcites →https://doi.org/10.1007/978-1-4757-4137-7_25openalex-snapshot
Choosing Search Heuristics by Non-Stationary Reinforcement Learning
inferredcites →https://doi.org/10.1007/978-1-4842-4470-8openalex-snapshot
Building Machine Learning and Deep Learning Models on Google Cloud Platform
inferredcites →https://doi.org/10.1007/978-3-030-73603-3_7openalex-snapshot
A Data-Driven Dynamic Discretization Framework to Solve Combinatorial Problems Using Continuous Metaheuristics
inferredcites →https://doi.org/10.1007/978-3-030-77445-5_29openalex-snapshot
A Machine Learning Firefly Algorithm Applied to the Matrix Covering Problem
inferredcites →https://doi.org/10.1007/s00521-014-1743-5openalex-snapshot
How important is a transfer function in discrete heuristic algorithms
inferredcites →https://doi.org/10.1007/s00521-019-04527-9openalex-snapshot
A reinforcement learning-based communication topology in particle swarm optimization
inferredcites →https://doi.org/10.1007/s10479-015-2034-yopenalex-snapshot
Combining metaheuristics with mathematical programming, constraint programming and machine learning
inferredcites →https://doi.org/10.1007/s10489-017-0972-6openalex-snapshot
A k-means binarization framework applied to multidimensional knapsack problem
inferredcites →https://doi.org/10.1007/s10732-010-9136-0openalex-snapshot
Quantum-inspired evolutionary algorithms: a survey and empirical study
inferredcites →https://doi.org/10.1007/s11721-015-0114-xopenalex-snapshot
Critical considerations on angle modulated particle swarm optimisers
inferredcites →https://doi.org/10.1007/s13748-019-00185-zopenalex-snapshot
A review on the self and dual interactions between machine learning and optimisation
inferredcites →https://doi.org/10.1007/s40031-014-0126-8openalex-snapshot
Performance Enhancement of Radial Distributed System with Distributed Generators by Reconfiguration Using Binary Firefly Algorithm
inferredcites →https://doi.org/10.1016/0377-2217(92)90215-uopenalex-snapshot
Enhancing an algorithm for set covering problems
inferredcites →https://doi.org/10.1016/j.advengsoft.2016.01.008openalex-snapshot
The Whale Optimization Algorithm
inferredcites →https://doi.org/10.1016/j.eswa.2016.10.054openalex-snapshot
Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization
inferredcites →https://doi.org/10.1016/j.future.2019.02.028openalex-snapshot
Harris hawks optimization: Algorithm and applications
inferredcites →https://doi.org/10.1016/j.ins.2018.01.005openalex-snapshot
Automatic design of hyper-heuristic based on reinforcement learning
inferredcites →https://doi.org/10.1016/j.knosys.2015.12.022openalex-snapshot
SCA: A Sine Cosine Algorithm for solving optimization problems
inferredcites →https://doi.org/10.1016/j.knosys.2016.01.031openalex-snapshot
A tensor based hyper-heuristic for nurse rostering
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.2021.107283openalex-snapshot
AIEOU: Automata-based improved equilibrium optimizer with U-shaped transfer function for feature selection
inferredcites →https://doi.org/10.1016/j.neucom.2017.04.053openalex-snapshot
Hybrid Whale Optimization Algorithm with simulated annealing for feature selection
inferredcites →https://doi.org/10.1016/j.orp.2015.03.001openalex-snapshot
A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems
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.100671openalex-snapshot
A better balance in metaheuristic algorithms: Does it exist?
inferredcites →https://doi.org/10.1109/access.2019.2946664openalex-snapshot
Long-Term Memory Harris’ Hawk Optimization for High Dimensional and Optimal Power Flow Problems
inferredcites →https://doi.org/10.1109/icsmc.1997.637339openalex-snapshot
A discrete binary version of the particle swarm algorithm
inferredcites →https://doi.org/10.1155/2017/8404231openalex-snapshot
Putting Continuous Metaheuristics to Work in Binary Search Spaces
inferredcites →https://doi.org/10.1155/2019/3238574openalex-snapshot
A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems
inferredcites →https://doi.org/10.1155/2020/6502807openalex-snapshot
Z-Shaped Transfer Functions for Binary Particle Swarm Optimization Algorithm
inferredcites →https://doi.org/10.1515/math-2017-0029openalex-snapshot
Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
inferredcites →https://doi.org/10.3390/electronics8101130openalex-snapshot
A New Quadratic Binary Harris Hawk Optimization for Feature Selection
inferredcites →https://doi.org/10.3390/math7010017openalex-snapshot
The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm
inferredcites →https://doi.org/10.3390/math9161839openalex-snapshot
Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics
inferredcites →https://doi.org/10.3390/math9202611openalex-snapshot
A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem
inferredcites →https://doi.org/10.7763/ijmlc.2012.v2.114openalex-snapshot
BMOA: Binary Magnetic Optimization Algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-34020-8_19openalex-snapshot
Multi-armed Bandit-Based Metaheuristic Operator Selection: The Pendulum Algorithm Binarization Case
inferred← citeshttps://doi.org/10.1007/978-3-031-70518-2_35openalex-snapshot
Optimizing the Feature Selection Problem with Pendulum Search Algorithm: Binarization Strategies and Their Impacts
inferred← citeshttps://doi.org/10.1007/978-3-031-74598-0_3openalex-snapshot
Chaotic Binary Fox Optimizer for Solving Set Covering Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-75543-9_6openalex-snapshot
Enhancing Reptile Search Algorithm Performance for the Knapsack Problem with Integration of Chaotic Map
inferred← citeshttps://doi.org/10.1007/978-3-031-83210-9_5openalex-snapshot
Unleashing Chaos: Enhanced Reptile Search for the Set Covering Problem
inferred← citeshttps://doi.org/10.1007/s42979-025-03758-zopenalex-snapshot
Exploring Chaotic Binarization Rules in the Binary Fox Optimizer for Complex Optimization Problems
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.124112openalex-snapshot
Intelligent decision-making for binary coverage: Unveiling the potential of the multi-armed bandit selector
inferred← citeshttps://doi.org/10.3390/biomimetics10050314openalex-snapshot
Application of Metaheuristics for Optimizing Predictive Models in iHealth: A Case Study on Hypotension Prediction in Dialysis Patients
inferred← citeshttps://doi.org/10.3390/biomimetics11010010openalex-snapshot
Binary Pufferfish Optimization Algorithm for Combinatorial Problems
inferred← citeshttps://doi.org/10.3390/biomimetics8050400openalex-snapshot
Binarization of Metaheuristics: Is the Transfer Function Really Important?
inferred← citeshttps://doi.org/10.3390/biomimetics9010009openalex-snapshot
Feature Selection Problem and Metaheuristics: A Systematic Literature Review about Its Formulation, Evaluation and Applications
inferred← citeshttps://doi.org/10.3390/biomimetics9050283openalex-snapshot
A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm
inferred← citeshttps://doi.org/10.3390/computers12120249openalex-snapshot
B-PSA: A Binary Pendulum Search Algorithm for the Feature Selection Problem
inferred← citeshttps://doi.org/10.3390/math10121963openalex-snapshot
A Novel Multi-Objective Hybrid Election Algorithm for Higher-Order Random Satisfiability in Discrete Hopfield Neural Network
inferred← citeshttps://doi.org/10.3390/math10162920openalex-snapshot
Combining a Population-Based Approach with Multiple Linear Models for Continuous and Discrete Optimization Problems
inferred← citeshttps://doi.org/10.3390/math10234529openalex-snapshot
Embedded Learning Approaches in the Whale Optimizer to Solve Coverage Combinatorial Problems
inferred← citeshttps://doi.org/10.3390/math10244776openalex-snapshot
Swarm-Inspired Computing to Solve Binary Optimization Problems: A Backward Q-Learning Binarization Scheme Selector
inferred← citeshttps://doi.org/10.3390/math11010129openalex-snapshot
Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review
inferred← citeshttps://doi.org/10.3390/math11092104openalex-snapshot
Optimizing Retaining Walls through Reinforcement Learning Approaches and Metaheuristic Techniques
inferred← citeshttps://doi.org/10.3390/math12020262openalex-snapshot
Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics
inferred← citeshttps://doi.org/10.3390/math13152482openalex-snapshot
Binary Secretary Bird Optimization Algorithm for the Set Covering Problem
inferred← citeshttps://doi.org/10.3390/math14142659openalex-snapshot
Adaptive Scoring-and-Memory Policies for Repair Intensification in the Multi-Demand Multidimensional Knapsack Problem: A Comparative Analysis of Solution Quality and Trajectory Diversity
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.