Pages that link to "Item:Q2897295"
From MaRDI portal
The following pages link to Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization (Q2897295):
Displaying 13 items.
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
- A note on solving MINLP's using formulation space search (Q2448189) (← links)
- Disjunctive programming and the generalized Leontief input-output model (Q2483224) (← links)
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs (Q3013929) (← links)
- On the Quantile Cut Closure of Chance-Constrained Problems (Q3186519) (← links)
- Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
- A trust-region framework for derivative-free mixed-integer optimization (Q6645947) (← links)
