Outer approximation for integer nonlinear programs via decision diagrams

DOI10.1007/s10107-020-01475-4zbMath1465.90044OpenAlexW3006199842MaRDI QIDQ2020602

Willem-Jan van Hoeve, Danial Davarnia

Publication date: 23 April 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-020-01475-4

zbMATH Keywords

dynamic programmingouter approximationcutting planesdecision diagramsinteger nonlinear programs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

Incorporating bounds from decision diagrams into integer programming, Efficient operations between MDDs and constraints, Strong relaxations for continuous nonlinear programs based on decision diagrams, Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, A graph-based decomposition method for convex quadratic optimization with indicators, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Improving the filtering of branch-and-bound MDD solver

Uses Software

• SHOT
• JuMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Decision diagrams for optimization
• Lift-and-project cuts for convex mixed integer nonlinear programs
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• A brief history of linear and mixed-integer programming computation
• Generalized Benders decomposition
• Discrete Optimization with Decision Diagrams
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Optimization Bounds from Binary Decision Diagrams
• Integer Programming
• Branching and bounds tighteningtechniques for non-convex MINLP
• Nonlinear Integer Programming
• On Threshold BDDs and the Optimal Variable Ordering Problem
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Disjunctive Programming
• Branching Programs and Binary Decision Diagrams
• Target Cuts from Relaxed Decision Diagrams
• Multivalued Decision Diagrams for Sequencing Problems
• Mixed-integer nonlinear optimization
• JuMP: A Modeling Language for Mathematical Optimization
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming