Projects funded by the NCN
The power of branching and learning for online scheduling and bin packingproblems
2022/47/D/ST6/02864
Keywords:
online algorithms upper and lower bounds computer search
Descriptors:
- ST6_006:
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Wrocławski, Wydział Matematyki i Informatyki
woj. dolnośląskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 1
Call: SONATA 18 - announced on 2022-07-15
Amount awarded: 264 891 PLN
Project start date (Y-m-d): 2023-07-18
Project end date (Y-m-d): 2026-07-17
Project duration:: 36 months (the same as in the proposal)
Project status: Pending project
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.
Information in the final report
- Articles in post-conference publications (1)
- Improved Online Load Balancing with Known MakespanAuthors:Martin Böhm, Matej Lieskovský, Sören Schmitt, Jiří Sgall, Rob van SteeConference:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024) (rok: 2024, tom: APPROX/RANDOM 2024, strony: 10:1-10:21), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für InformatikData:konferencja 2024-08-28 to 2024-08-30Status:PublishedDOI:10.4230/LIPIcs.APPROX/RANDOM.2024.10 - link to the publication