The following pages link to Mixing mixed-integer inequalities (Q5943076):
Displaying 50 items.
- On the mixing set with a knapsack constraint (Q291057) (← links)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Composite lifting of group inequalities and an application to two-row mixing inequalities (Q429671) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- On a class of mixed-integer sets with a single integer variable (Q614040) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- Lot-sizing on a tree (Q924877) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
- The mixing set with divisible capacities: a simple approach (Q1043241) (← links)
- Valid inequalities for mixed 0-1 programs (Q1076609) (← links)
- Strong formulations for mixed integer programs: valid inequalities and extended formulations (Q1403296) (← links)
- Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Stochastic lot sizing problem with nervousness considerations (Q1652600) (← links)
- Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design (Q1652658) (← links)
- A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
- A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
- Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity (Q2097654) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Modeling interdependencies in infrastructure systems using multi-layered network flows (Q2297565) (← links)
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
- A linear programming approach for linear programs with probabilistic constraints (Q2356018) (← links)
- On intersection of two mixing sets with applications to joint chance-constrained programs (Q2414899) (← links)
- On mixing sets arising in chance-constrained programming (Q2429465) (← links)
- Sequential pairing of mixed integer inequalities (Q2471272) (← links)
- Polyhedral properties for the intersection of two knapsacks (Q2476986) (← links)
