Seminar of Jay Yellen / Friday 22 May @ UMONS
| Posted by: | Bernard FORTZ |
| Date: | 2015-05-02 |
| Contact: | [email protected] |
Dear colleagues,
The Algorithms Lab of the University of Mons (Department of Computer =
Science, Faculty of Science) is very pleased to invite you to a seminar =
given by Jay Yellen (Rollins College, Florida) on Friday May 22. Jay =
Yellen is well known as the co-author of the book =C2=AB Graph Theory =
and its applications =C2=BB (with J. Gross). This event is free and =
everybody is welcome but, as sandwiches and drinks will be provided, =
please send us an email before May 21 (hadrien.melot [at] umons.ac.be =
) if you intend to come.
A dual-objective course-timetabling problem: minimize conflict and =
create compact schedules
by Jay Yellen (Rollins College, Florida, US)
Friday 22 May, 12:15
Salle du Conseil, Grands Amphith=C3=A9=C3=A2tres
Plaine de Nimy, UMONS
<>Abstract. The talk will focus on describing a metaheuristic approach =
to coloring the vertices of a weighted graph whose edges have =
2-component weights reflecting the two objectives. The vertex- and =
color-selection strategies and a priority queue for partial colorings =
use linear combinations of various heuristics that are based on the =
underlying structure of the graph as the coloring proceeds. A =
mixed-integer formulation that gives an exact solution will also be =
presented, and comparisons between the two approaches will be given. The =
talk will conclude with the introduction of the robust-chromatic-number =
problem, a pure graph theory problem that arises naturally from the task =
of modifying a timetable.
Please forward this announcement to potentially interested colleagues.
We hope to see you soon in Mons !
Pierre Hauweele and Hadrien M=C3=A9lot
Note : here is a map if you don=E2=80=99t know how to come at UMONS : =
http://portail.umons.ac.be/en2/universite/admin/cerp/plancampus/pages/plan=
acces.aspx
--
Prof. Hadrien M=C3=A9lot
Algorithms Lab - UMONS
http://informatique.umons.ac.be/algo
