The following pages link to Mixing mixed-integer inequalities (Q5943076):
Displaying 27 items.
- Lot-sizing with production and delivery time windows (Q2492704) (← links)
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
- On formulations of the stochastic uncapacitated lot-sizing problem (Q2494816) (← links)
- Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
- A note on the continuous mixing set (Q2517804) (← links)
- Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
- Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment (Q2957470) (← links)
- On the Quantile Cut Closure of Chance-Constrained Problems (Q3186519) (← links)
- The Mixing Set with Divisible Capacities (Q3503864) (← links)
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs (Q4609472) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
- Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data (Q5139613) (← links)
- Nonunique Lifting of Integer Variables in Minimal Inequalities (Q5376544) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem (Q6038656) (← links)
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators (Q6561224) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)
- Value of risk aversion in perishable products supply chain management (Q6624438) (← links)
