Target cuts from relaxed decision diagrams
type: Item
instance of: scholarly article
title: Target Cuts from Relaxed Decision Diagrams
zbMATH Open document ID: 1474.90291
author: Tjandraatmadja Christian
author: Van Hoeve Willem-Jan
published in: INFORMS Journal on Computing
publication date: 2020-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 7281712
zbMATH Keywords: integer programming
zbMATH Keywords: cutting planes
zbMATH Keywords: decision diagrams
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2939087242
cites work: Binary Decision Diagrams
cites work: Engineering branch-and-cut algorithms for the equicut problem
cites work: Experimental and Efficient Algorithms
cites work: Manipulating MDD relaxations for combinatorial optimization
cites work: Optimization Bounds from Binary Decision Diagrams
cites work: Decision diagrams for optimization
cites work: Discrete optimization with decision diagrams
cites work: Lifting and separation procedures for the cut polytope
cites work: On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Local cuts revisited
cites work: Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
cites work: An exact algorithm for robust network design
cites work: Reflections on generating (disjunctive) cuts
cites work: Local cuts for mixed-integer programming
cites work: Multivalued decision diagrams for sequencing problems
cites work: Q2753173
cites work: An MDD approach to multidimensional bin packing
cites work: The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
cites work: Q5628016
cites work: Polyhedral Characterization of Discrete Dynamic Programming
cites work: Q3818127
cites work: Branching Programs and Binary Decision Diagrams
DOI: 10.1287/IJOC.2018.0830
Recommended article: Discrete optimization with decision diagrams
Recommended article: Outer approximation for integer nonlinear programs via decision diagrams
Recommended article: Incorporating bounds from decision diagrams into integer programming
Recommended article: On disjunctive cuts for combinatorial optimization
Recommended article: Optimization Bounds from Binary Decision Diagrams
description: scientific article; zbMATH DE number 7281712