Outer approximation for integer nonlinear programs via decision diagrams
DOI10.1007/S10107-020-01475-4zbMATH Open1465.90044OpenAlexW3006199842MaRDI QIDQ2020602FDOQ2020602
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
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
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)
Cites Work
- On Threshold BDDs and the Optimal Variable Ordering Problem
- JuMP: a modeling language for mathematical optimization
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Mixed-integer nonlinear optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized Benders decomposition
- Discrete optimization with decision diagrams
- 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
- Multivalued decision diagrams for sequencing problems
- A brief history of linear and mixed-integer programming computation
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive Programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Branching and bounds tighteningtechniques for non-convex MINLP
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Nonlinear integer programming
- Optimization Bounds from Binary Decision Diagrams
- Decision diagrams for optimization
- Title not available (Why is that?)
- Disjunctive cuts for mixed integer nonlinear programming problems
- Quasiconvex programming
- Integer Programming
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Target cuts from relaxed decision diagrams
Cited In (10)
- Incorporating bounds from decision diagrams into integer programming
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Target cuts from relaxed decision diagrams
- A graph-based decomposition method for convex quadratic optimization with indicators
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Efficient operations between MDDs and constraints
- Improving the filtering of branch-and-bound MDD solver
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
Uses Software
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)
