The following pages link to Disjunctive Programming (Q4197624):
Displaying 47 items.
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Operating room scheduling with generalized disjunctive programming (Q342094) (← links)
- Short-term scheduling of multiple source pipelines with simultaneous injections and deliveries (Q342409) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- On mixed-integer sets with two integer variables (Q408383) (← links)
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Monoidal cut strengthening revisited (Q435731) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Split cuts for robust mixed-integer optimization (Q439905) (← links)
- Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- Three modeling paradigms in mathematical programming (Q607499) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning (Q613606) (← links)
- A note on the MIR closure and basic relaxations of polyhedra (Q635512) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
- A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (Q5129213) (← links)
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem (Q5137957) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
- Cut-Generating Functions and <i>S</i>-Free Sets (Q5252221) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- Lifts for Voronoi cells of lattices (Q6050227) (← links)
- A computational study of perspective cuts (Q6062884) (← links)
- Optimization problems involving matrix multiplication with applications in materials science and biology (Q6094500) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
