The following pages link to Disjunctive Programming (Q4686608):
Displaying 19 items.
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems (Q1986109) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements (Q2147012) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
- Assembly planning by disjunctive programming and geometrical reasoning (Q2669707) (← links)
- Two-halfspace closure (Q2689824) (← links)
- Polyhedral Results and Branch-and-Cut for the Resource Loading Problem (Q4995060) (← links)
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis (Q5870347) (← links)
- A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems (Q6104921) (← links)
- Constrained composite optimization and augmented Lagrangian methods (Q6110459) (← links)
- Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey (Q6112694) (← links)
- An outer-approximation algorithm for maximum-entropy sampling (Q6202951) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
- Facet separation for disjunctive constraints with network flow representation (Q6644361) (← links)
