https://www.hcm.uni-bonn.de/computational-combinatorial-optimization-2022/
Dates: September 12 - 16, 2022
Venue: Arithmeum (Gerhard-Konow-Hörsaal, Bonn)
Organizers: William Cook (Waterloo) and Stephan Held (Bonn)
Most combinatorial optimization problems, e.g. the travelling salesman
problem, graph coloring, or the Steiner tree problem, have wide
practical applications. Thus, a large research community is working on
advancing the computational tractability of these mostly NP-hard
problems. This Hausdorff School will provide the unique opportunity for
PhD students and PostDocs to gain in depth knowledge from leading
researchers in this area.
Key Speakers: The following speakers will give a lecture series:
Armin Biere (Freiburg)
Robert Bixby (Houston)
Petra Mutzel (Bonn)
Eduardo Uchoa (Rio de Janeiro)
Please send applications using this form. Limited financial support for
PhD students and postdocs may be available.
To be considered for participation, a CV and Letter of Intent (1 page)
are required, as well as the name and contact information of a potential
reference. (At this time, do not request a letter of recommendation.)
Only one document can be uploaded, so please combine all documentation
into one PDF.
Please note: Everyone interested in participating - disregarding whether
there is need for financial support or not - has to register so that the
participation may be administered. Everyone will be notified in due time
about whether participation and partial financial support is possible.
Late applications may be considered, but to be given full consideration,
please complete all information before the deadline.
The deadline for applications is July 15, 2022.
In case of questions, please contact the organizers at
computational(at)hcm.uni-bonn.de.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************