The following pages link to Disjunctive Programming (Q4197624):
Displaying 50 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)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- Enhanced mixed integer programming techniques and routing problems (Q657574) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798) (← links)
- Relaxations of linear programming problems with first order stochastic dominance constraints (Q867928) (← links)
- On optimality and duality theorems of nonlinear disjunctive fractional minmax programs (Q872111) (← links)
