On the public citation graph

Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem

https://doi.org/10.1007/10721187_3
0 signed · 48 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(198704)34:2<161::aid-nav3220340203>3.0.co;2-aopenalex-snapshot
A heuristic solution procedure for the multiconstraint zero-one knapsack problem
inferredcites →https://doi.org/10.1002/fedr.19750860506openalex-snapshot
Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann-Holzboog-Verlag. Stuttgart 1973. Broschiert
inferredcites →https://doi.org/10.1007/10721187_2openalex-snapshot
On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.1007/978-3-662-03423-1_2openalex-snapshot
Robust Encodings in Genetic Algorithms
inferredcites →https://doi.org/10.1007/bfb0026608openalex-snapshot
A priori comparison of binary crossover operators: No universal statistical measure, but a set of hints
inferredcites →https://doi.org/10.1007/bfb0056932openalex-snapshot
A permutation based Genetic Algorithm for minimum span frequency assignment
inferredcites →https://doi.org/10.1016/0377-2217(84)90286-8openalex-snapshot
A heuristic algorithm for the multidimensional zero-one knapsack problem
inferredcites →https://doi.org/10.1016/0377-2217(91)90159-sopenalex-snapshot
Knapsack problems, algorithms and computer implementations
inferredcites →https://doi.org/10.1023/a:1009642405419openalex-snapshot
A Genetic Algorithm for the Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.1080/03155986.1994.11732253openalex-snapshot
Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
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/icec.1994.350050openalex-snapshot
Mapping, order-independent genes and the knapsack problem
inferredcites →https://doi.org/10.1109/icec.1996.542328openalex-snapshot
Using fitness distributions to design more efficient evolutionary computations
inferredcites →https://doi.org/10.1109/icec.1998.699502openalex-snapshot
An improved genetic algorithm for the multiconstrained 0-1 knapsack problem
inferredcites →https://doi.org/10.1109/icec.1998.699753openalex-snapshot
Causality of hierarchical variable length representations
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations
inferredcites →https://doi.org/10.48550/arxiv.adap-org/9711001openalex-snapshot
A condition for the genotype-phenotype mapping: Causality
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/10721187_2openalex-snapshot
On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1007/11729976_29openalex-snapshot
On the Locality of Grammatical Evolution
inferred← citeshttps://doi.org/10.1007/3-540-26981-9_61openalex-snapshot
A Two-Phase Grammar-Based Genetic Algorithm for a Workshop Scheduling Problem
inferred← citeshttps://doi.org/10.1007/3-540-45110-2_48openalex-snapshot
On the Locality of Representations
inferred← citeshttps://doi.org/10.1007/3-540-45356-3_34openalex-snapshot
A Comparison of Two Representations for the Fixed Charge Transportation Problem
inferred← citeshttps://doi.org/10.1007/3-540-45712-7_8openalex-snapshot
Direct Representation and Variation Operators for the Fixed Charge Transportation Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-36229-2_26openalex-snapshot
Morphological Evolution of Aerial Robots: Comparing Genetic Encodings
inferred← citeshttps://doi.org/10.1007/978-3-540-31996-2_4openalex-snapshot
An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-72960-0_11openalex-snapshot
Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality
inferred← citeshttps://doi.org/10.1007/978-3-662-43505-2_53openalex-snapshot
Design of Representations and Search Operators
inferred← citeshttps://doi.org/10.1007/s10710-011-9136-3openalex-snapshot
Defining locality as a problem difficulty measure in genetic programming
inferred← citeshttps://doi.org/10.1007/s10710-015-9262-4openalex-snapshot
Unveiling the properties of structured grammatical evolution
inferred← citeshttps://doi.org/10.1109/cec.2006.1688590openalex-snapshot
Analysis of Locality in Hybrid Evolutionary Cluster Optimization
inferred← citeshttps://doi.org/10.1109/cec.2006.1688593openalex-snapshot
The Role of Representation on the Multidimensional Knapsack Problem by means of Fitness Landscape Analysis
inferred← citeshttps://doi.org/10.1109/cec.2011.5949779openalex-snapshot
Mutation operator characterization: Exhaustiveness, locality, and bias
inferred← citeshttps://doi.org/10.1109/icmse.2009.5317499openalex-snapshot
Competitive decision algorithm for multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1109/ssci47803.2020.9308438openalex-snapshot
Locality Bounds for Nonredundant Binary-Integer Representations
inferred← citeshttps://doi.org/10.1109/tevc.2006.871241openalex-snapshot
Guest Editorial Special Section on Analysis and Design of Representations and Operators
inferred← citeshttps://doi.org/10.1109/tevc.2011.2173579openalex-snapshot
Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design
inferred← citeshttps://doi.org/10.1109/tsmcb.2008.915539openalex-snapshot
Multidimensional Knapsack Problem: A Fitness Landscape Analysis
inferred← citeshttps://doi.org/10.1145/1068009.1068214openalex-snapshot
Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach
inferred← citeshttps://doi.org/10.1145/335527.335530openalex-snapshot
The multiple container packing problem
inferred← citeshttps://doi.org/10.1145/335603.335866openalex-snapshot
Permutation-based evolutionary algorithms for multidimensional knapsack problems
inferred← citeshttps://doi.org/10.1145/3583131.3590472openalex-snapshot
Biological insights on grammar-structured mutations improve fitness and diversity
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.20873/uftv9-11058openalex-snapshot
APPLICATION OF GENETIC ALGORITHM IN A LOGISTIC ENGINEERING PROBLEM
inferred← citeshttps://doi.org/10.33612/diss.864174360openalex-snapshot
Evolvability and organismal architecture
inferred← citeshttps://doi.org/10.3389/frobt.2021.672379openalex-snapshot
Constrained by Design: Influence of Genetic Encodings on Evolved Traits of Robots
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12159openalex-snapshot
Revisiting Locality in Binary-Integer Representations
inferred← citeshttps://doi.org/10.7717/peerj-cs.561openalex-snapshot
An analysis of the locality of binary representations in genetic and evolutionary algorithms
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.