On the public citation graph

A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem

0 signed · 62 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/1520-6750(199410)41:6<833::aid-nav3220410611>3.0.co;2-qopenalex-snapshot
Note: On the set-union knapsack problem
inferredcites →https://doi.org/10.1007/978-1-4419-1306-7_1openalex-snapshot
Metaheuristics: Intelligent Problem Solving
inferredcites →https://doi.org/10.1007/s00500-019-04021-3openalex-snapshot
Solving the set-union knapsack problem by a novel hybrid Jaya algorithm
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/s11277-020-07960-5openalex-snapshot
Design and Modeling of a Compact Power Divider with Squared Resonators Using Artificial Intelligence
inferredcites →https://doi.org/10.1007/s12351-018-0427-9openalex-snapshot
Weighted superposition attraction algorithm for binary optimization problems
inferredcites →https://doi.org/10.1007/s12652-020-02255-wopenalex-snapshot
Performance-aware energy-efficient parallel job scheduling in HPC grid using nature-inspired hybrid meta-heuristics
inferredcites →https://doi.org/10.1007/s13042-015-0450-6openalex-snapshot
Predicting protein–protein interaction sites using modified support vector machine
inferredcites →https://doi.org/10.1007/s13042-017-0772-7openalex-snapshot
An artificial algae algorithm for solving binary optimization problems
inferredcites →https://doi.org/10.1007/s13042-019-00931-8openalex-snapshot
Binary multi-verse optimization algorithm for global optimization and discrete problems
inferredcites →https://doi.org/10.1007/s13042-020-01085-8openalex-snapshot
Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem
inferredcites →https://doi.org/10.1016/j.asoc.2021.107260openalex-snapshot
Multistart solution-based tabu search for the Set-Union Knapsack Problem
inferredcites →https://doi.org/10.1016/j.cie.2019.07.007openalex-snapshot
Artificial search agents with cognitive intelligence for binary optimization problems
inferredcites →https://doi.org/10.1016/j.cie.2020.106478openalex-snapshot
Hybrid heuristics for the cut ordering planning problem in apparel industry
inferredcites →https://doi.org/10.1016/j.dam.2013.12.015openalex-snapshot
A note on the set union knapsack problem
inferredcites →https://doi.org/10.1016/j.ejor.2016.01.042openalex-snapshot
An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
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.eswa.2020.113802openalex-snapshot
Kernel based tabu search for the Set-union Knapsack Problem
inferredcites →https://doi.org/10.1016/j.future.2017.05.044openalex-snapshot
A novel binary artificial bee colony algorithm for the set-union knapsack problem
inferredcites →https://doi.org/10.1016/j.future.2018.08.002openalex-snapshot
A swarm intelligence-based algorithm for the set-union knapsack problem
inferredcites →https://doi.org/10.1016/j.future.2019.07.062openalex-snapshot
Iterated two-phase local search for the Set-Union Knapsack Problem
inferredcites →https://doi.org/10.1016/j.knosys.2018.07.045openalex-snapshot
Group theory-based optimization algorithm for solving knapsack problems
inferredcites →https://doi.org/10.1016/j.knosys.2020.105586openalex-snapshot
Evolutionary and adaptive inheritance enhanced Grey Wolf Optimization algorithm for binary domains
inferredcites →https://doi.org/10.1016/j.measurement.2020.108427openalex-snapshot
Combination of X-ray tube and GMDH neural network as a nondestructive and potential technique for measuring characteristics of gas-oil–water three phase flows
inferredcites →https://doi.org/10.1016/j.trc.2019.06.016openalex-snapshot
A matheuristic for the vehicle routing problem with drones and its variants
inferredcites →https://doi.org/10.1108/dta-05-2020-0120openalex-snapshot
An efficient local search for large-scale set-union knapsack problem
inferredcites →https://doi.org/10.1108/ijhma-05-2020-0067openalex-snapshot
Forecasting house prices in Iran using GMDH
inferredcites →https://doi.org/10.1109/access.2019.2940538openalex-snapshot
Estimation of Distribution Algorithm Based on Lévy Flight for Solving the Set-Union Knapsack Problem
inferredcites →https://doi.org/10.1109/access.2019.2956839openalex-snapshot
Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems
inferredcites →https://doi.org/10.1109/iccchinaw.2016.7586727openalex-snapshot
System resilience enhancement through modularization for large scale cyber systems
inferredcites →https://doi.org/10.1111/j.1467-8659.2010.01715.xopenalex-snapshot
A Key‐Pose Caching System for Rendering an Animated Crowd in Real‐Time
inferredcites →https://doi.org/10.1145/3457607openalex-snapshot
A Survey on Bias and Fairness in Machine Learning
inferredcites →https://doi.org/10.1155/2017/8404231openalex-snapshot
Putting Continuous Metaheuristics to Work in Binary Search Spaces
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/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/math8030398openalex-snapshot
Robust Design Optimization for Low-Cost Concrete Box-Girder Bridge
inferredcites →https://doi.org/10.3390/math8040507openalex-snapshot
A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.3390/math8040555openalex-snapshot
A Hybrid k-Means Cuckoo Search Algorithm Applied to the Counterfort Retaining Walls Problem
inferredcites →https://doi.org/10.3390/math8060862openalex-snapshot
The Buttressed Walls Problem: An Application of a Hybrid Clustering Particle Swarm Optimization Algorithm
inferredcites →https://doi.org/10.3390/math9030225openalex-snapshot
An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics
inferredcites →https://doi.org/10.3390/math9161839openalex-snapshot
Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics

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-70518-2_35openalex-snapshot
Optimizing the Feature Selection Problem with Pendulum Search Algorithm: Binarization Strategies and Their Impacts
inferred← citeshttps://doi.org/10.1007/s00500-022-07285-4openalex-snapshot
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem
inferred← citeshttps://doi.org/10.1007/s42979-026-04770-7openalex-snapshot
Using Reinforcement Learning to Boost Grey Wolf Optimizer for Influence Maximization in Social Networks
inferred← citeshttps://doi.org/10.1016/j.asoc.2026.115946openalex-snapshot
An adaptive fuzzy-penalty swarm metaheuristic for the multi-demand multidimensional Knapsack problem
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.1016/j.knosys.2024.112095openalex-snapshot
CUDA-based parallel local search for the set-union knapsack problem
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114439openalex-snapshot
A neural network-based iterative heuristic algorithm for the polynomial robust knapsack problem
inferred← citeshttps://doi.org/10.1016/j.neucom.2025.132135openalex-snapshot
Recent Advances in Knapsack Problem: A Comprehensive Review of Models, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1109/access.2025.3529317openalex-snapshot
Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem
inferred← citeshttps://doi.org/10.1155/2022/7897644openalex-snapshot
Optimization Method of RFID Reader Antenna Deployment in Obstacle Environment Based on Improved FA
inferred← citeshttps://doi.org/10.3390/app15042059openalex-snapshot
Exploring the Impact of Local Operator Configurations in the Multi-Demand Multidimensional Knapsack Problem
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/math10173183openalex-snapshot
Binarization Technique Comparisons of Swarm Intelligence Algorithm: An Application to the Multi-Demand Multidimensional Knapsack Problem
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/math11010140openalex-snapshot
Hybrid Swarm Intelligence Optimization Methods for Low-Embodied Energy Steel-Concrete Composite Bridges
inferred← citeshttps://doi.org/10.3390/math11122695openalex-snapshot
Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem
inferred← citeshttps://doi.org/10.3390/math14122208openalex-snapshot
Beyond Neural Solvers: A Critical Review of Machine Learning for Combinatorial Optimization
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
inferred← citeshttps://doi.org/10.3390/math9222887openalex-snapshot
A Novel Learning-Based Binarization Scheme Selector for Swarm Algorithms Solving Combinatorial Problems
inferred← citeshttps://doi.org/10.4995/thesis/10251/195967openalex-snapshot
Optimal Deep Learning Assisted Design of Socially and Environmentally Efficient Steel Concrete Composite Bridges under Constrained Budgets
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.