On finding the optimal BDD relaxation
type: Item
instance of: scholarly article
title: On finding the optimal BDD relaxation
zbMATH Open document ID: 1489.68248
DOI: 10.1007/978-3-319-59776-8_4
author: Yanyan Li
publication date: 2017-08-04T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6756574
describes a project that uses: azove
MaRDI profile type: Publication
full work available at URL: 978-3-319-59776-8 4
OpenAlex ID: W2618496063
cites work: Binary Decision Diagrams
cites work: On threshold BDDs and the optimal variable ordering problem
cites work: MDD Propagation for Sequence Constraints
cites work: Optimization Bounds from Binary Decision Diagrams
cites work: Discrete optimization with decision diagrams
cites work: Decision diagrams for optimization
cites work: Manipulating MDD Relaxations for Combinatorial Optimization
cites work: Dynamic programming and optimal control. Vol. 2
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
description: scientific article; zbMATH DE number 6756574