Mixing mixed-integer inequalities
From MaRDI portal
Publication:5943076
DOI10.1007/s101070100224zbMath1041.90033MaRDI QIDQ5943076
Publication date: 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
On the mixing set with a knapsack constraint, An integer programming approach for linear programs with probabilistic constraints, On the Quantile Cut Closure of Chance-Constrained Problems, Relaxations and approximations of chance constraints under finite distributions, Theoretical challenges towards cutting-plane selection, Stochastic lot sizing problem with nervousness considerations, Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design, Intersection Disjunctions for Reverse Convex Sets, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning, Covering Linear Programming with Violations, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set, Discrete multi-module capacitated lot-sizing problems with multiple items, On intersection of two mixing sets with applications to joint chance-constrained programs, On a class of mixed-integer sets with a single integer variable, A polyhedral study on chance constrained program with random right-hand side, New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem, A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support, Relaxations for two-level multi-item lot-sizing problems, A computational analysis of lower bounds for big bucket production planning problems, The Mixing Set with Divisible Capacities, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem, Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Chance-constrained set covering with Wasserstein ambiguity, On mixing sets arising in chance-constrained programming, Composite lifting of group inequalities and an application to two-row mixing inequalities, Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs, A polyhedral study of the static probabilistic lot-sizing problem, Nonunique Lifting of Integer Variables in Minimal Inequalities, A note on the split rank of intersection cuts, Multiechelon Lot Sizing: New Complexities and Inequalities, Lot-sizing on a tree, The mixing-MIR set with divisible capacities, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data, Strong-branching inequalities for convex mixed integer nonlinear programs, Cutting planes from extended LP formulations, Sequential pairing of mixed integer inequalities, Facets for continuous multi-mixing set with general coefficients and bounded integer variables, Extended formulations in combinatorial optimization, Convex hull representation of the deterministic bipartite network interdiction problem, Polyhedral properties for the intersection of two knapsacks, Mixing MIR inequalities with two divisible coefficients, Cutting planes in integer and mixed integer programming, Extended formulations in combinatorial optimization, Lot-sizing with production and delivery time windows, Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity, On formulations of the stochastic uncapacitated lot-sizing problem, Mixing polyhedra with two non divisible coefficients, Chvatal--Gomory--tier cuts for general integer programs, Description of 2-integer continuous knapsack polyhedra, Valid inequalities for mixed integer linear programs, Lifting convex inequalities for bipartite bilinear programs, A note on the continuous mixing set, On quantile cuts and their closure for chance constrained optimization problems, A survey of network interdiction models and algorithms, Modeling interdependencies in infrastructure systems using multi-layered network flows, Lifting convex inequalities for bipartite bilinear programs, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs, The mixing set with divisible capacities: a simple approach, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity, A linear programming approach for linear programs with probabilistic constraints, Nonlinear chance-constrained problems with applications to hydro scheduling, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
