Sequential pairing of mixed integer inequalities
From MaRDI portal
Publication:2471272
DOI10.1016/j.disopt.2006.10.003zbMath1188.90183OpenAlexW2055307349MaRDI QIDQ2471272
Shabbir Ahmed, Yongpei Guan, Nemhauser, George I.
Publication date: 22 February 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.003
Related Items
On the mixing set with a knapsack constraint, An integer programming approach for linear programs with probabilistic constraints, Relaxations and approximations of chance constraints under finite distributions, Covering Linear Programming with Violations, A polyhedral study on chance constrained program with random right-hand side, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, On the complexity of cutting-plane proofs using split cuts, Special issue: Global solution of integer, stochastic and nonconvex optimization problems, A linear programming approach for linear programs with probabilistic constraints
Cites Work
- Unnamed Item
- Chvátal closures for mixed integer programming problems
- Dynamic knapsack sets and capacitated lot-sizing
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Sequential Pairing of Mixed Integer Inequalities
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Introduction to Stochastic Programming
- The mixed vertex packing problem.
- Mixing mixed-integer inequalities
