Cutting plane algorithm for convex generalized disjunctive programs
From MaRDI portal
Recommendations
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- A disjunctive cut strengthening technique for convex MINLP
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Disjunctive cuts for mixed integer nonlinear programming problems
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A hierarchy of relaxations for linear generalized disjunctive programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- A tree-search algorithm for mixed integer programming problems
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Convex programming for disjunctive convex optimization
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generalized Benders decomposition
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Mixed-integer nonlinear optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
Cited in
(20)- A surrogate cutting plane algorithm for all-integer programming
- On global optimality conditions and cutting plane algorithms
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- A discrete dynamic convexized method for the max-cut problem
- A disjunctive cut strengthening technique for convex MINLP
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Partial hyperplane activation for generalized intersection cuts
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- A cutting method for finding discrete minimax with dropping of cutting planes
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- A constraint programming approach to cutset problems
- A convex-analysis perspective on disjunctive cuts
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- scientific article; zbMATH DE number 3856823 (Why is no real title available?)
- scientific article; zbMATH DE number 1778406 (Why is no real title available?)
- Disjunctive cuts in mixed-integer conic optimization
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
- 50 years of mixed-integer nonlinear and disjunctive programming
- P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints
This page was built for publication: Cutting plane algorithm for convex generalized disjunctive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186647)
