Branch & Memorize exact algorithms for sequencing problems : efficient embedding of memorization into search trees
Year of publication: |
2021
|
---|---|
Authors: | Shang, Lei ; T'kindt, Vincent ; Della Croce, Federico |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 128.2021, p. 1-13
|
Subject: | Scheduling | Exact algorithms | Memorization | Branch and memorize | Sequencing | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
An exact algorithm for the Blocks Relocation Problem with new lower bounds
Quispe, Kent E. Yucra, (2018)
-
An overview of curriculum-based course timetabling
Bettinelli, Andrea, (2015)
-
Heuristic methods to consecutive block minimization
Soares, Leonardo C. R., (2020)
- More ...
-
Shang, Lei, (2019)
-
Exact exponential algorithms for 3-machine flowshop scheduling problems
Shang, Lei, (2018)
-
Exact solution of the two-machine flow shop problem with three operations
Della Croce, Federico, (2022)
- More ...