Decision diagram-based branch-and-bound with caching for dominance and suboptimality detection
Year of publication: |
2024
|
---|---|
Authors: | Coppé, Vianney ; Gillard, Xavier ; Schaus, Pierre |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 6, p. 1522-1542
|
Subject: | branch-and-bound | caching | decision diagrams | discrete optimization | Entscheidung | Decision | Entscheidungstheorie | Decision theory | Mathematische Optimierung | Mathematical programming |
-
Decision diagrams for discrete optimization : a survey of recent advances
Castro, Margarita P., (2022)
-
Policy-based branch-and-bound for infinite-horizon multi-model Markov decision processes
Ahluwalia, Vinayak S., (2021)
-
Improving variable orderings of approximate decision diagrams using reinforcement learning
Cappart, Quentin, (2022)
- More ...
-
A dynamic programming approach for the job sequencing and tool switching problem
Legrand, Emma, (2024)
-
Global Migration in the 20th and 21st Centuries: the Unstoppable Force of Demography
Dao, Thu Hien, (2018)
-
Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach
Derval, Guillaume, (2022)
- More ...