On the public citation graph

Utilizing dynastically optimal forma recombination in hybrid genetic algorithms

https://doi.org/10.1007/bfb0056873
0 signed · 29 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/3-540-58484-6_252openalex-snapshot
Genetic algorithms with multi-parent recombination
inferredcites →https://doi.org/10.1007/3-540-64582-9_772openalex-snapshot
On decision-making in strong hybrid evolutionary algorithms
inferredcites →https://doi.org/10.1007/978-3-7091-7535-4_73openalex-snapshot
Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP
inferredcites →https://doi.org/10.1007/bf01531276openalex-snapshot
The algebra of genetic algorithms
inferredcites →https://doi.org/10.1016/0303-2647(94)90009-4openalex-snapshot
Foundations of genetic algorithms. 2
inferredcites →https://doi.org/10.1016/b978-1-55860-356-1.50007-8openalex-snapshot
Fitness Variance of Formae and Performance Prediction
inferredcites →https://doi.org/10.1057/jors.1990.166openalex-snapshot
OR-Library: Distributing Test Problems by Electronic Mail
inferredcites →https://doi.org/10.1162/evco.1998.6.1.25openalex-snapshot
Genetic Forma Recombination in Permutation Flowshop Problems
inferredcites →https://doi.org/10.2307/2582903openalex-snapshot
OR-Library: Distributing Test Problems by Electronic Mail
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48056-5_5openalex-snapshot
A Gentle Introduction to Memetic Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45356-3_32openalex-snapshot
Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search
inferred← citeshttps://doi.org/10.1007/3-540-45561-2_34openalex-snapshot
Using a Hybrid Evolutionary-A* Approach for Learning Reactive Behaviours
inferred← citeshttps://doi.org/10.1007/3-540-46033-0_19openalex-snapshot
Evolving Objects: A General Purpose Evolutionary Computation Library
inferred← citeshttps://doi.org/10.1007/3-540-48774-3_23openalex-snapshot
Tackling Epistatic Problems Using Dynastically Optimal Recombination
inferred← citeshttps://doi.org/10.1007/978-3-319-30698-8_10openalex-snapshot
Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-85569-9_9openalex-snapshot
Improvements in Recall and Precision in Wolters Kluwer Spain Legal Search Engine
inferred← citeshttps://doi.org/10.1007/978-3-642-20364-0_19openalex-snapshot
On Complexity of the Optimal Recombination for the Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.amc.2003.08.115openalex-snapshot
Performance comparison of memetic algorithms
inferred← citeshttps://doi.org/10.1016/s0167-739x(99)00129-6openalex-snapshot
Analyzing synchronous and asynchronous parallel distributed genetic algorithms
inferred← citeshttps://doi.org/10.1023/a:1021934325079openalex-snapshot
Embedding Branch and Bound within Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1109/ssci47803.2020.9308295openalex-snapshot
The Unexpected Virtue of Problem Reductions or How to Solve Problems Being Lazy but Wise
inferred← citeshttps://doi.org/10.1134/s1990478916020071openalex-snapshot
On complexity of optimal recombination for flowshop scheduling problems
inferred← citeshttps://doi.org/10.1145/335603.335886openalex-snapshot
On the influence of the representation granularity in heuristic forma recombination
inferred← citeshttps://doi.org/10.1145/967900.968101openalex-snapshot
Solving the error correcting code problem with parallel hybrid heuristics
inferred← citeshttps://doi.org/10.2298/yjor130731040eopenalex-snapshot
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I
inferred← citeshttps://doi.org/10.2298/yjor131030041eopenalex-snapshot
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II
inferred← citeshttps://doi.org/10.4236/ijcns.2012.511081openalex-snapshot
On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1412.5067openalex-snapshot
Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups
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.