Tight formulations for some simple mixed integer programs and convex objective integer programs
From MaRDI portal
Publication:1424279
DOI10.1007/s10107-003-0397-3zbMath1047.90035OpenAlexW2061416946MaRDI QIDQ1424279
Andrew J. Miller, Laurence A. Wolsey
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0397-3
Related Items
Single item lot-sizing with non-decreasing capacities, An integer programming approach for linear programs with probabilistic constraints, Relaxations and approximations of chance constraints under finite distributions, Intersection Disjunctions for Reverse Convex Sets, Robust network design: Formulations, valid inequalities, and computations, Covering Linear Programming with Violations, A polyhedral study on chance constrained program with random right-hand side, The Mixing Set with Divisible Capacities, \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem, On mixing sets arising in chance-constrained programming, Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs, A note on the split rank of intersection cuts, Lot-sizing on a tree, Compact formulations as a union of polyhedra, The mixing-MIR set with divisible capacities, Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, An adaptive model with joint chance constraints for a hybrid wind-conventional generator system, Extended formulations in combinatorial optimization, Convex hull representation of the deterministic bipartite network interdiction problem, Mixing MIR inequalities with two divisible coefficients, Extended formulations in combinatorial optimization, Lot-sizing with production and delivery time windows, On formulations of the stochastic uncapacitated lot-sizing problem, Strong formulations of robust mixed 0-1 programming, Valid inequalities for mixed integer linear programs, A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management, A note on the continuous mixing set, Multi-item lot-sizing with joint set-up costs, The mixing set with divisible capacities: a simple approach, Approximating two-stage chance-constrained programs with classical probability bounds, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, A linear programming approach for linear programs with probabilistic constraints
