On the public citation graph

Calibrated posterior binarization for continuous metaheuristics in binary optimization

0 signed · 74 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.1007/978-1-4615-1539-5openalex-snapshot
Estimation of Distribution Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-24777-7openalex-snapshot
Knapsack Problems
inferredcites →https://doi.org/10.1007/978-3-642-52307-6_8openalex-snapshot
Improvements of General Multiple Test Procedures for Redundant Systems of Hypotheses
inferredcites →https://doi.org/10.1007/bf01397280openalex-snapshot
�ber den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik
inferredcites →https://doi.org/10.1007/bf01397477openalex-snapshot
Zur Quantenmechanik der Sto�vorg�nge
inferredcites →https://doi.org/10.1007/s00158-025-04078-9openalex-snapshot
An improved quantum-inspired evolutionary algorithm framework implemented to solve minimum vertex cover problem
inferredcites →https://doi.org/10.1007/s00291-024-00746-2openalex-snapshot
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
inferredcites →https://doi.org/10.1007/s00521-022-07869-zopenalex-snapshot
Learning the transfer function in binary metaheuristic algorithm for feature selection in classification problems
inferredcites →https://doi.org/10.1007/s00521-024-09436-0openalex-snapshot
BinDMO: a new Binary Dwarf Mongoose Optimization algorithm on based Z-shaped, U-shaped, and taper-shaped transfer functions for CEC-2017 benchmarks
inferredcites →https://doi.org/10.1007/s101070100263openalex-snapshot
Benchmarking optimization software with performance profiles
inferredcites →https://doi.org/10.1007/s10462-022-10333-yopenalex-snapshot
RG-NBEO: a ReliefF guided novel binary equilibrium optimizer with opposition-based S-shaped and V-shaped transfer functions for feature selection
inferredcites →https://doi.org/10.1007/s10586-024-04927-0openalex-snapshot
V-shaped and S-shaped binary artificial protozoa optimizer (APO) algorithm for wrapper feature selection on biological data
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/s10994-017-5641-9openalex-snapshot
Statistical comparison of classifiers through Bayesian hierarchical modelling
inferredcites →https://doi.org/10.1007/s11030-022-10410-yopenalex-snapshot
A novel nonlinear time-varying sigmoid transfer function in binary whale optimization algorithm for descriptors selection in drug classification
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.1007/s11128-023-04025-xopenalex-snapshot
A universal quantum algorithm for weighted maximum cut and Ising problems
inferredcites →https://doi.org/10.1007/s11356-023-26300-1openalex-snapshot
No-free-lunch-theorem: a page taken from the computational intelligence for water resources planning and management
inferredcites →https://doi.org/10.1007/s12065-022-00721-2openalex-snapshot
Quantum Entanglement inspired Grey Wolf optimization algorithm and its application
inferredcites →https://doi.org/10.1007/s12293-025-00481-3openalex-snapshot
An adaptive binary particle swarm optimization algorithm with filtration and local search for feature selection in text classification
inferredcites →https://doi.org/10.1016/0377-2217(95)00159-xopenalex-snapshot
A genetic algorithm for the set covering problem
inferredcites →https://doi.org/10.1016/j.advengsoft.2013.12.007openalex-snapshot
Grey Wolf Optimizer
inferredcites →https://doi.org/10.1016/j.advengsoft.2016.01.008openalex-snapshot
The Whale Optimization Algorithm
inferredcites →https://doi.org/10.1016/j.advengsoft.2017.07.002openalex-snapshot
Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems
inferredcites →https://doi.org/10.1016/j.aej.2022.12.025openalex-snapshot
Binary light spectrum optimizer for knapsack problems: An improved model
inferredcites →https://doi.org/10.1016/j.apenergy.2023.120915openalex-snapshot
Metaheuristic for the integrated electric vehicle and crew scheduling problem
inferredcites →https://doi.org/10.1016/j.apm.2023.08.043openalex-snapshot
Role-oriented binary grey wolf optimizer using foraging-following and Lévy flight for feature selection
inferredcites →https://doi.org/10.1016/j.asoc.2024.111696openalex-snapshot
Metaheuristics exposed: Unmasking the design pitfalls of arithmetic optimization algorithm in benchmarking
inferredcites →https://doi.org/10.1016/j.cma.2020.113609openalex-snapshot
The Arithmetic Optimization Algorithm
inferredcites →https://doi.org/10.1016/j.cor.2024.106747openalex-snapshot
Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problem
inferredcites →https://doi.org/10.1016/j.cosrev.2023.100559openalex-snapshot
Advances in nature-inspired metaheuristic optimization for feature selection problem: A comprehensive survey
inferredcites →https://doi.org/10.1016/j.ejor.2026.01.003openalex-snapshot
Multi-objective robust optimization for facility location problem of personalized medicine supply chain
inferredcites →https://doi.org/10.1016/j.engappai.2012.09.001openalex-snapshot
Breakout Local Search for the Max-Cutproblem
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.knosys.2015.12.022openalex-snapshot
SCA: A Sine Cosine Algorithm for solving optimization problems
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.knosys.2024.111578openalex-snapshot
Search space division method for wrapper feature selection on high-dimensional data classification
inferredcites →https://doi.org/10.1016/j.knosys.2024.112699openalex-snapshot
Fitness and historical success information-assisted binary particle swarm optimization for feature selection
inferredcites →https://doi.org/10.1016/j.orl.2022.10.011openalex-snapshot
A fast exact pricing algorithm for the railway crew scheduling problem
inferredcites →https://doi.org/10.1016/j.swevo.2011.02.002openalex-snapshot
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
inferredcites →https://doi.org/10.1016/j.swevo.2011.08.003openalex-snapshot
An introduction and survey of estimation of distribution algorithms
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.100665openalex-snapshot
Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: Practical guidelines and a critical review
inferredcites →https://doi.org/10.1016/j.trpro.2022.02.102openalex-snapshot
On a Real-World Railway Crew Scheduling Problem
inferredcites →https://doi.org/10.1023/a:1009642405419openalex-snapshot
A Genetic Algorithm for the Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.1023/a:1019225027893openalex-snapshot
Algorithms for the Set Covering Problem
inferredcites →https://doi.org/10.1038/s41598-024-75743-0openalex-snapshot
An integrated binary metaheuristic approach in dynamic unit commitment and economic emission dispatch for hybrid energy systems
inferredcites →https://doi.org/10.1057/jors.1990.166openalex-snapshot
OR-Library: Distributing Test Problems by Electronic Mail
inferredcites →https://doi.org/10.1080/01621459.1986.10478341openalex-snapshot
Modified Sequentially Rejective Multiple Test Procedures
inferredcites →https://doi.org/10.1080/01621459.1993.10476358openalex-snapshot
On a Monotonicity Problem in Step-Down Multiple Test Procedures
inferredcites →https://doi.org/10.1080/03610928008827904openalex-snapshot
Approximations of the critical region of the fbietkan statistic
inferredcites →https://doi.org/10.1109/4235.771166openalex-snapshot
Parameter control in evolutionary algorithms
inferredcites →https://doi.org/10.1109/4235.797971openalex-snapshot
The compact genetic algorithm
inferredcites →https://doi.org/10.1109/access.2023.3263584openalex-snapshot
Threshold Binary Grey Wolf Optimizer Based on Multi-Elite Interaction for Feature Selection
inferredcites →https://doi.org/10.1109/icnn.1995.488968openalex-snapshot
Particle swarm optimization
inferredcites →https://doi.org/10.1109/tevc.2002.804320openalex-snapshot
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
inferredcites →https://doi.org/10.1109/tevc.2007.894200openalex-snapshot
Opposition-Based Differential Evolution
inferredcites →https://doi.org/10.1109/tevc.2014.2308294openalex-snapshot
Parameter Control in Evolutionary Algorithms: Trends and Challenges
inferredcites →https://doi.org/10.1111/itor.12001openalex-snapshot
Metaheuristics—the metaphor exposed
inferredcites →https://doi.org/10.1137/s1052623497328987openalex-snapshot
A Spectral Bundle Method for Semidefinite Programming
inferredcites →https://doi.org/10.1155/2017/8404231openalex-snapshot
Putting Continuous Metaheuristics to Work in Binary Search Spaces
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.1287/opre.47.5.730openalex-snapshot
A Heuristic Method for the Set Covering Problem
inferredcites →https://doi.org/10.1371/journal.pone.0315842openalex-snapshot
Solving the maximum cut problem using Harris Hawk Optimization algorithm
inferredcites →https://doi.org/10.32614/rj-2016-017openalex-snapshot
scmamp: Statistical Comparison of Multiple Algorithms in Multiple Problems
inferredcites →https://doi.org/10.3390/a15010024openalex-snapshot
Transfer Learning for Operator Selection: A Reinforcement Learning Approach
inferredcites →https://doi.org/10.3390/app15189955openalex-snapshot
Binary Puma Optimizer: A Novel Approach for Solving 0-1 Knapsack Problems and the Uncapacitated Facility Location Problem
inferredcites →https://doi.org/10.3390/biomimetics11030197openalex-snapshot
A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem
inferredcites →https://doi.org/10.3390/biomimetics8050400openalex-snapshot
Binarization of Metaheuristics: Is the Transfer Function Really Important?
inferredcites →https://doi.org/10.3390/math11010129openalex-snapshot
Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review
inferredcites →https://doi.org/10.3390/math12020262openalex-snapshot
Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics
inferredcites →https://doi.org/10.3390/math13152482openalex-snapshot
Binary Secretary Bird Optimization Algorithm for the Set Covering Problem
inferredcites →https://doi.org/10.3390/math13193129openalex-snapshot
An Experimental Study of Transfer Functions and Binarization Strategies in Binary Arithmetic Optimization Algorithms for the Set Covering Problem
inferredcites →https://doi.org/10.3390/math9161839openalex-snapshot
Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics
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.