Bryant A. Julstrom
Affiliations:- St. Cloud State University, St. Cloud, MN, USA
According to our database1,
Bryant A. Julstrom
authored at least 64 papers
between 1985 and 2012.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
2010
0
1
2
3
4
5
6
7
8
9
1
1
2
1
1
2
1
3
1
4
3
6
5
5
4
7
2
2
2
2
3
2
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on linkedin.com
On csauthors.net:
Bibliography
2012
Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012
Naive and heuristic permutation-coded genetic algorithms for the quadratic knapsack problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012
Proceedings of the Genetic and Evolutionary Computation Conference, 2012
2010
Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010
2009
ACM J. Exp. Algorithmics, 2009
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
2008
A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem.
Proceedings of the Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008
Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008
An evolutionary algorithm for some cases of the single-source constrained plant location problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008
2006
IEEE Trans. Evol. Comput., 2006
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006
Proceedings of the Parallel Problem Solving from Nature, 2006
Proceedings of the Genetic and Evolutionary Computation Conference, 2006
Proceedings of the Genetic and Evolutionary Computation Conference, 2006
Proceedings of the Genetic and Evolutionary Computation Conference, 2006
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006
2005
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005
Proceedings of the Genetic and Evolutionary Computation Conference, 2005
Proceedings of the Genetic and Evolutionary Computation Conference, 2005
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005
2004
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004
Proceedings of the Genetic and Evolutionary Computation, 2004
Proceedings of the Genetic and Evolutionary Computation, 2004
Proceedings of the Genetic and Evolutionary Computation, 2004
2003
IEEE Trans. Evol. Comput., 2003
A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles.
Proceedings of the International Conference on VLSI, 2003
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003
A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003
Proceedings of the Genetic and Evolutionary Computation, 2003
2002
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002
Proceedings of the Parallel Problem Solving from Nature, 2002
Applying Local Search n a Genetic Algorithm for the 4-Cycle Problem.
Proceedings of the International Conference on Artificial Intelligence, 2002
A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem.
Proceedings of the International Conference on Artificial Intelligence, 2002
Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem.
Proceedings of the International Conference on Artificial Intelligence, 2002
Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem.
Proceedings of the Late Breaking papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), 2002
Proceedings of the 2002 Congress on Evolutionary Computation, 2002
2001
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001
2000
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
Proceedings of the Applied Computing 2000, 2000
Proceedings of the 2000 Congress on Evolutionary Computation, 2000
1999
Proceedings of the 1999 ACM Symposium on Applied Computing, 1999
Proceedings of the 1999 Congress on Evolutionary Computation, 1999
1998
Proceedings of the 1998 ACM symposium on Applied Computing, 1998
Proceedings of the 1998 ACM symposium on Applied Computing, 1998
1997
Proceedings of the 1997 ACM symposium on Applied Computing, 1997
Effects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payoffs in the Iterated Prisoner's Dilemma.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997
Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97), 1997
1996
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996
1995
Proceedings of the 1995 ACM symposium on applied computing, 1995
What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm.
Proceedings of the 6th International Conference on Genetic Algorithms, 1995
1994
Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994
1993
A Genetic Algorithm for the Rectilinear Steiner Problem.
Proceedings of the 5th International Conference on Genetic Algorithms, 1993
1992
SIGACT News, 1992
1985