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 |
-
Research trends in combinatorial optimization
Weinand, Jann Michael, (2022)
-
Akçay, Fatih Burak, (2025)
-
A multivariate complexity analysis of the material consumption scheduling problem
Bentert, Matthias, (2023)
- More ...
-
Exact solution of the two-machine flow shop problem with three operations
Della Croce, Federico, (2022)
-
Moderate exponential-time algorithms for scheduling problems
T'kindt, Vincent, (2022)
-
A constraint generation approach for two-machine shop problems with jobs selection
Della Croce, Federico, (2017)
- More ...