<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bryant A. Julstrom | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/bryant-a.-julstrom/</link><atom:link href="https://ac.tuwien.ac.at/team/bryant-a.-julstrom/index.xml" rel="self" type="application/rss+xml"/><description>Bryant A. Julstrom</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 01 Jan 2006 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Bryant A. Julstrom</title><link>https://ac.tuwien.ac.at/team/bryant-a.-julstrom/</link></image><item><title>Biased Mutation Operators for Subgraph-Selection Problems</title><link>https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems-2/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems-2/</guid><description/></item><item><title>Biased Mutation Operators for Subgraph-Selection Problems</title><link>https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/biased-mutation-operators-for-subgraph-selection-problems/</guid><description/></item><item><title>A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem</title><link>https://ac.tuwien.ac.at/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-weighted-coding-in-a-genetic-algorithm-for-the-degree-constrained-minimum-spanning-tree-problem/</guid><description/></item></channel></rss>