Improving branch-and-bound using decision diagrams and reinforcement learning
type: Item
instance of: scholarly article
title: Improving branch-and-bound using decision diagrams and reinforcement learning
DOI: 10.1007/978-3-030-78230-6_28
author: Yanyan Li
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7493645
zbMATH Keywords: decision diagrams
zbMATH Keywords: branch-and-bound
zbMATH Keywords: reinforcement learning
describes a project that uses: azove
MaRDI profile type: Publication
full work available at URL: 978-3-030-78230-6 28
OpenAlex ID: W3168531812
cites work: Statistical mechanics of complex networks
cites work: On Threshold BDDs and the Optimal Variable Ordering Problem
cites work: Discrete optimization with decision diagrams
cites work: Decision diagrams for optimization
cites work: Manipulating MDD Relaxations for Combinatorial Optimization
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Multivalued Decision Diagrams for Sequencing Problems
cites work: Three-dimensional matching instances are rich in stable matchings
cites work: An MDD Approach to Multidimensional Bin Packing
cites work: Q5628016
cites work: Benchmarking optimization software with performance profiles.
cites work: Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
cites work: Q4626283
cites work: \({\mathcal Q}\)-learning
description: scientific article; zbMATH DE number 7493645