Pages that link to "Item:Q1281382"
From MaRDI portal
The following pages link to Disjunctive programming: Properties of the convex hull of feasible points (Q1281382):
Displaying 50 items.
- Disjunctive optimization: Critical point theory (Q1379955) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Models for representing piecewise linear cost functions (Q1433660) (← links)
- Evolution and state-of-the-art in integer programming (Q1593833) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- Valid inequalities for the single arc design problem with set-ups (Q1751105) (← links)
- Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (Q1753130) (← links)
- Logical constraints as cardinality rules: Tight representation (Q1768603) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
- Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359) (← links)
- Centered solutions for uncertain linear equations (Q1789636) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Sequential convexification in reverse convex and disjunctive programming (Q1825137) (← links)
- Representability of functions (Q1825755) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems (Q2074837) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
- Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays (Q2108176) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand (Q2253993) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- Valid inequalities for concave piecewise linear regression (Q2294266) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases (Q2311118) (← links)
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
