Generalized disjunctive programming: solution strategies
From MaRDI portal
Recommendations
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A hierarchy of relaxations for linear generalized disjunctive programming
Cited in
(12)- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Generalized partial computation using disunification to solve constraints
- Achieving MILP feasibility quickly using general disjunctions
- Disjunctive programming and the generalized Leontief input-output model
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
- A hierarchy of relaxations for linear generalized disjunctive programming
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
This page was built for publication: Generalized disjunctive programming: solution strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917384)