Outer approximation for integer nonlinear programs via decision diagrams
From MaRDI portal
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
- 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 and bounds tighteningtechniques for non-convex MINLP
- Branching Programs and Binary Decision Diagrams
- 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 cuts for mixed integer nonlinear programming problems
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Generalized Benders decomposition
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- 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?)
- 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
(11)- 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
- Efficient operations between MDDs and constraints
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Target cuts from relaxed decision diagrams
- A graph-based decomposition method for convex quadratic optimization with indicators
- On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment
- 50 years of mixed-integer nonlinear and disjunctive programming
- Incorporating bounds from decision diagrams into integer programming
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)
