Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Year of publication: |
2023
|
---|---|
Authors: | Jooken, Jorik ; Leyman, Pieter ; Wauters, Tony ; De Causmaecker, Patrick |
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. 150.2023, p. 1-25
|
Subject: | Combinatorial optimization | Monte Carlo tree search | Quay crane scheduling problem with non-crossing constraints | 0-1 Knapsack problem | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Monte-Carlo-Simulation | Monte Carlo simulation | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand, (2023)
-
Temporal bin packing with half-capacity jobs
Muir, Christopher, (2024)
-
Silva, Allyson, (2021)
- More ...
-
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Jooken, Jorik, (2023)
-
A new class of hard problem instances for the 0-1 knapsack problem
Jooken, Jorik, (2022)
-
Evolving test instances of the Hamiltonian completion problem
Lechien, Thibault, (2023)
- More ...