Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Julstrom, Bryant A. - Department of Computer Science, St. Cloud State University
ADAPTIVE OPERATOR PROBABILITIES IN A GENETIC ALGORITHM THAT APPLIES THREE OPERATORS
Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges
Seeding the Population: Improved Performance in a Genetic Algorithm for the Rectilinear Steiner Problem
EVOLUTIONARY DISCOVERY OF DFA SIZE AND STRUCTURE
Very Greedy Crossover in a Genetic Algorithm for the Traveling Salesman Problem
Greedy Heuristics and an Evolutionary Algorithm for the BoundedDiameter Minimum Spanning Tree Problem
Greedy, Genetic, and Greedy Genetic Algorithms for the Quadratic Knapsack Problem
A SpanningTreeBased Genetic Algorithm for Some Instances of the Rectilinear
A WEIGHT-CODED GENETIC ALGORITHM FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
COMPARING DECODING ALGORITHMS IN A WEIGHT-CODED GA FOR TSP
Evolving Heuristically Difficult Instances of Combinatorial Problems
An Evolutionary Algorithm for Some Cases of the Single-Source Constrained Plant Location Problem
Two Hybrid Evolutionary Algorithms for the Rectilinear Steiner Arborescence Problem
WeightBiased EdgeCrossover in Evolutionary Algorithms for Two Graph Problems
Evolutionary Codings and Operators for the Terminal Assignment Problem
String-and Permutation-Coded Genetic Algorithms for the Static Weapon-Target Assignment Problem
Greedy Heuristics and Evolutionary Algorithms for the Bounded Minimum-Label Spanning Tree Problem
Instance Similarity and the Effectiveness of Case Injection in a Genetic Algorithm for Binary Quadratic Programming
The Quadratic Multiple Knapsack Problem and Three Heuristic Approaches to It
An Effective Genetic Algorithm for the Minimum-Label Spanning Tree Problem
Encoding Rectilinear Steiner Trees as Lists of Edges Bryant A. Julstrom
A Genetic Algorithm for the Longest Common Subsequence Problem
The Blob Code is Competitive with EdgeSets in Genetic Algorithms for the Minimum
Comparing Darwinian, Baldwinian, and Lamarckian Search in a Genetic Algorithm for the 4Cycle Problem
CODING TSP TOURS AS PERMUTATIONS VIA AN INSERTION HEURISTIC
E ects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payo s
REPRESENTING RECTILINEAR STEINER TREES IN GENETIC ALGORITHMS
Evolving Petri Nets to Represent Metabolic Pathways
Call Me EMail: Arranging the Keyboard with a PermutationCoded Genetic Algorithm
A Data-Based Coding of Candidate Strings in the Closest String Problem