Sequential pairing of mixed integer inequalities

DOI10.1016/J.DISOPT.2006.10.003MaRDI QIDQ2471272zbMATH OpenOpenAlexFDO

Authors Yongpei Guan, S. Ahmed, G. L. Nemhauser

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

zbMATH Keywords

cutting planesinteger programming

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Sequential Pairing of Mixed Integer Inequalities
• Mixing mixed-integer inequalities
• Cutting planes in integer and mixed integer programming
• Sequential-Merge Facets for Two-Dimensional Group Problems
• Classical cuts for mixed-integer programming and branch-and-cut

Cites work

• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Chvátal closures for mixed integer programming problems
• Dynamic knapsack sets and capacitated lot-sizing
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Introduction to Stochastic Programming
• Mixing mixed-integer inequalities
• Sequential Pairing of Mixed Integer Inequalities
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• The mixed vertex packing problem.

Cited in

(11)

• Relaxations and approximations of chance constraints under finite distributions
• 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
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems
• A linear programming approach for linear programs with probabilistic constraints
• On the mixing set with a knapsack constraint
• Covering linear programming with violations
• Sequential Pairing of Mixed Integer Inequalities
• Mixing mixed-integer inequalities
• An integer programming approach for linear programs with probabilistic constraints
• On the complexity of cutting-plane proofs using split cuts

This page was built for publication: Sequential pairing of mixed integer inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471272)