We are delighted to announce the talk given by Premysl Sucha (CTU in
Prague).
The title is "Machine Learning Inside Decomposition of Scheduling
Problems". The seminar will take place on Zoom on Wednesday, April 9 at
13:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/93077786062?pwd=Cj5lSGL0PI5el3qj3nBkbTXMh3ZTKc.1
Meeting ID: 930 7778 6062
Passcode: 851384
You can follow the seminar online or offline on our Youtube channel as
well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A
The abstract follows.
Problem decomposition refers to general techniques for efficiently
solving large instances. The fact that decomposition splits the problem
into smaller subproblems and then combines their solutions into a
solution to the original problem opens up many possibilities for
applying machine learning. There are two main advantages why it is
suitable. The first is that the subproblems are solved
repeatedly/recursively, so similar instances are solved multiple times.
The second is that the subproblems are smaller and thus easier to
combine with machine learning. In this talk, we show two successful
applications of machine learning to speed up scheduling algorithms based
on decomposition techniques, namely branch and price and Lawler's
decomposition.
The talk by Christian Blum (IIIA-CSIC) planed on March 26 is cancelled
due to personal reasons of the speaker. Nevertheless, the next talk in
our series will be:
Christian Blum (IIIA-CSIC) | April 23 | CMSA: A Hybrid Metaheuristic for
Combinatorial Optimization
For more details, please visit https://schedulingseminar.com/
With kind regards
Zdenek Hanzalek, Michael Pinedo and Guohua Wan
--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/
**********************************************************
*
* 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/
*
**********************************************************
Posts
