Outer approximation for integer nonlinear programs via decision diagrams
type: Item
instance of: scholarly article
title: Outer approximation for integer nonlinear programs via decision diagrams
zbMATH Open document ID: 1465.90044
author: Danial Davarnia
author: Willem-Jan van Hoeve
published in: Mathematical Programming. Series A. Series B
publication date: 2021-04-23T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7337507
zbMATH Keywords: decision diagrams
zbMATH Keywords: cutting planes
zbMATH Keywords: outer approximation
zbMATH Keywords: dynamic programming
zbMATH Keywords: integer nonlinear programs
describes a project that uses: SHOT
describes a project that uses: JuMP
MaRDI profile type: Publication
full work available at URL: s10107-020-01475-4
OpenAlex ID: W3006199842
cites work: Disjunctive Programming
cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
cites work: On Threshold BDDs and the Optimal Variable Ordering Problem
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Mixed-integer nonlinear optimization
cites work: Optimization Bounds from Binary Decision Diagrams
cites work: Decision diagrams for optimization
cites work: Discrete optimization with decision diagrams
cites work: Q3151174
cites work: A brief history of linear and mixed-integer programming computation
cites work: Algorithms and Software for Convex Mixed Integer Nonlinear Programs
cites work: Q3109952
cites work: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
cites work: Multivalued Decision Diagrams for Sequencing Problems
cites work: Integer Programming
cites work: JuMP: A Modeling Language for Mathematical Optimization
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Q5290264
cites work: Q4198056
cites work: Generalized Benders decomposition
cites work: Nonlinear Integer Programming
cites work: Lift-and-project cuts for convex mixed integer nonlinear programs
cites work: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
cites work: Q5628016
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Target Cuts from Relaxed Decision Diagrams
cites work: Branching Programs and Binary Decision Diagrams
DOI: 10.1007/S10107-020-01475-4
description: scientific article; zbMATH DE number 7337507