Incorporating bounds from decision diagrams into integer programming
type: Item
instance of: scholarly article
title: Incorporating bounds from decision diagrams into integer programming
zbMATH Open document ID: 1476.90202
author: Christian Tjandraatmadja
author: Willem-Jan van Hoeve
published in: Mathematical Programming Computation
publication date: 2021-12-16T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7447065
zbMATH Keywords: integer programming
zbMATH Keywords: decision diagrams
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: conflict graph
describes a project that uses: SCIP
describes a project that uses: MIPLIB
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: s12532-020-00191-6
OpenAlex ID: W3096869031
cites work: Conflict analysis in mixed integer programming
cites work: SCIP: solving constraint integer programs
cites work: Presolve Reductions in Mixed Integer Programming
cites work: Binary Decision Diagrams
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Conflict graphs in solving integer programming problems
cites work: Experimental and Efficient Algorithms
cites work: On Threshold BDDs and the Optimal Variable Ordering Problem
cites work: Decomposition Based on Decision Diagrams
cites work: Lagrangian bounds from decision diagrams
cites work: Manipulating MDD Relaxations for Combinatorial Optimization
cites work: Decision diagrams for optimization
cites work: Discrete optimization with decision diagrams
cites work: Optimization Bounds from Binary Decision Diagrams
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Multivalued Decision Diagrams for Sequencing Problems
cites work: Outer approximation for integer nonlinear programs via decision diagrams
cites work: Constraint propagation with interval labels
cites work: Hybrid optimization methods for time-dependent sequencing problems
cites work: Q5628016
cites work: Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Target Cuts from Relaxed Decision Diagrams
cites work: Collective dynamics of ‘small-world’ networks
cites work: Branching Programs and Binary Decision Diagrams
DOI: 10.1007/S12532-020-00191-6
description: scientific article; zbMATH DE number 7447065