Accelerating the branch-and-price algorithm using machine learning
Year of publication: |
16 December 2018
|
---|---|
Authors: | Václavík, Roman ; Novak, Antonin ; Šůcha, Přemysl ; Hanzálek, Zdeněk |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 271.2018, 3 (16.12.), p. 1055-1069
|
Subject: | Scheduling | Branch-and-price | Pricing problem | Machine learning | Wpper bound | Theorie | Theory | Künstliche Intelligenz | Artificial intelligence | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
A machine learning approach to rank pricing problems in branch-and-price
Koutecká, Pavlína, (2025)
-
Scheduling with non-renewable resources : minimizing the sum of completion times
Bérczi, Kristóf, (2024)
-
Scheduling with periodic availability constraints to minimize makespan
Yu, Lishi, (2024)
- More ...
-
Minimizing the weighted number of tardy jobs on a single machine : strongly correlated instances
Hejl, Lukáš, (2022)
-
Bouška, Michal, (2023)
-
Adaptive online scheduling of tasks with anytime property on heterogeneous resources
Módos, István, (2016)
- More ...