Outer approximation for integer nonlinear programs via decision diagrams

DOI10.1007/S10107-020-01475-4MaRDI QIDQ2020602zbMATH OpenOpenAlexFDO

Authors Danial Davarnia, Willem-Jan van Hoeve

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 programmingcutting planesouter approximationdecision diagramsinteger nonlinear programs

Mathematics Subject Classification ID

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

Recommendations

• Incorporating bounds from decision diagrams into integer programming
• Theoretical insights and algorithmic tools for decision diagram-based optimization
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Target cuts from relaxed decision diagrams
• Discrete optimization with decision diagrams

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3353170 (Why is no real title available?)
• A brief history of linear and mixed-integer programming computation
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Branching Programs and Binary Decision Diagrams
• Branching and bounds tighteningtechniques for non-convex MINLP
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Decision diagrams for optimization
• Discrete optimization with decision diagrams
• Disjunctive Programming
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Disjunctive cuts for mixed integer nonlinear programming problems
• Generalized Benders decomposition
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Integer Programming
• JuMP: a modeling language for mathematical optimization
• Lift-and-project cuts for convex mixed integer nonlinear programs
• Mixed-integer nonlinear optimization
• Multivalued decision diagrams for sequencing problems
• Nonlinear integer programming
• On Threshold BDDs and the Optimal Variable Ordering Problem
• Optimization Bounds from Binary Decision Diagrams
• Quasiconvex programming
• Target cuts from relaxed decision diagrams
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming

Cited in

(10)

• Strong relaxations for continuous nonlinear programs based on decision diagrams
• Incorporating bounds from decision diagrams into integer programming
• A graph-based decomposition method for convex quadratic optimization with indicators
• Target cuts from relaxed decision diagrams
• On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment
• Efficient operations between MDDs and constraints
• Improving the filtering of branch-and-bound MDD solver
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem

Describes a project that uses

Uses Software

• SHOT
• JuMP

This page was built for publication: Outer approximation for integer nonlinear programs via decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020602)