<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=utf-8">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 14px;" lang="x-unicode">Dear Optimization Community,
<br>
<br>
The University of Erlangen (FAU), Germany, is organizing an
optimization challenge focussed on optimal train timetables. The
task is to come up with models and algorithms to compute
timetables that are minimal with respect to the resulting energy
cost by the operation of the trains. All researchers (from
students up to professors) may participate in teams between two
and five people. The only condition is that at least one team
member is non-German or is affiliated to a non-German university.
Teams affiliated to the University of Erlangen may take part out
of competition.
<br>
<br>
We especially encourage young scientists to take part. So feel
free to pass this email to your students. The team with the best
solutions to the challenge instances will be invited to Erlangen
for one week this October, all expenses covered. During this time,
the winners have the opportunity to visit our research group on
discrete optimization, discuss their solutions with us, explore
possibilities for future collaboration or career development, get
to know the cultural and culinary highlights of Germany in general
and Bavaria in particular, and finally present their work at the
popular science fair "Long Night of Science".
<br>
<br>
More information can be found here:
<br>
<a class="moz-txt-link-freetext"
href="https://openresearchchallenge.org/">https://openresearchchallenge.org/</a>
<br>
<br>
Note that the FAU Open Research Challenge comprises three seperate
challenges,
<br>
whose topics are digital forensics, discrete optimization, and
photonic technologies.
<br>
<br>
The homepage of our optimization challenge is here:
<br>
<a class="moz-txt-link-freetext"
href="https://openresearchchallenge.org/discreteOptimization/ChairofEconomics">https://openresearchchallenge.org/discreteOptimization/ChairofEconomics</a>
<br>
<br>
The challenge is already online and closes by the end of July.
<br>
<br>
We look forward to your participation and will be happy to greet
the winners here in Erlangen!
<br>
<br>
Prof. Dr. Alexander Martin and
<br>
Dipl-Math. Andreas Baermann
<br>
Chair of Economics, Discrete Optimization, and Mathematics
<br>
FAU Erlangen-Nuernberg, Germany
<br>
<br>
<br>
PS: You can ask your questions concerning the rules of the
competition and the functioning of the challenge website here:
<br>
openresearchchallenge[at]fau.de
<br>
<br>
For questions concerning the formation of teams and the
optimization task itself, you can use the challenge forum on the
website (preferred) or directly send them to:
<br>
Andreas.Baermann[at]math.uni-erlangen.de
<br>
<br>
<div class="moz-txt-sig"><span class="moz-txt-tag">-- <br>
</span>Andreas Baermann
<br>
Friedrich-Alexander-Universitaet Erlangen-Nuernberg
<br>
Department Mathematik
<br>
Lehrstuhl fuer Wirtschaftsmathematik
<br>
Cauerstraße 11
<br>
91058 Erlangen
<br>
<br>
E-Mail: Andreas.Baermann[at]math.uni-erlangen.de
<br>
Tel.: +49 (9131) 85-67159
<br>
</div>
</div>
</body>
</html>