The EU-funded Research Training Network Algorithmic Methods for Optimizing the Railways in Europe (AMORE) was organizing its 2nd research seminar on railway optimization problems. It was mainly addressed to researchers on a pre- or post-doctoral level. Interested individuals from outside the AMORE network were explicitly encouraged to participate.
The focus of the 2nd AMORE Research Seminar was on scheduling and planning. A series of lectures introduced the participants to known problems and existing solutions on the above topic. There were also talks regarding current research on railway optimization problems. The following speakers have given presentations:
| Dines Bjørner | (Technical University of Denmark) |
| Torsten Fahle | (University of Paderborn) |
| Christos Goumopoulos | (Lyseis Ltd. , Patras) |
| Efthymios Housos | (University of Patras, Greece) |
| Leo Kroon | (Erasmus University Rotterdam) |
| Gábor Maróti | (CWI, Amsterdam) |
| Michela Milano | (University of Bologna) |
| Paolo Penna | (ETH Zurich, Switzerland) |
| Frank Schulz | (University of Patras) |
| Christos Valouxis | (University of Patras) |
| Gerhard Woeginger | (University of Twente, The Netherlands) |
The seminar took place at the newly built Conference Center of the University of Patras, located within the University campus and having a panoramic view of the Corinthian Gulf. The lectures were given in room II-9. Arrivals were expected on Monday evening, 29 October, and departures on Saturday afternoon, 3 November.
All interested participants (either within or outside the AMORE network) should register before Wednesday, 10 October, 2001. To register, the registration form had to be filled. The registration fee for participants outside the AMORE network was 60 Euro and covered the lectures, lunches, coffee breaks and social events. Besides the name, address, and other practical information, participants were asked to provide a short CV indicating their academic stage and background. Attendance was limited and registrations were accommodated on a first-come-first-served basis.