Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set

DOI10.1016/j.disopt.2012.07.003zbMath1281.90030MaRDI QIDQ1926486

Kiavash Kianfar, Sujeevraja Sanjeevi

Publication date: 28 December 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.07.003

zbMATH Keywords

mixed integer programming; mixing; cutting planes; mixed \(n\)-step MIR; multi-module capacitated facility location; multi-module capacitated lot-sizing

Mathematics Subject Classification ID

90C11: Mixed integer programming

Related Items

Valid inequalities and facets for multi‐module survivable network design problem, Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets, \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem, Theoretical challenges towards cutting-plane selection, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, Facets for continuous multi-mixing set with general coefficients and bounded integer variables, Capacitated lot-sizing problem with outsourcing, Discrete multi-module capacitated lot-sizing problems with multiple items, Lot Sizing with Piecewise Concave Production Costs

Uses Software

• MIPLIB
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composite lifting of group inequalities and an application to two-row mixing inequalities
• On the exact separation of mixed integer knapsack cuts
• A note on the split rank of intersection cuts
• The mixing-MIR set with divisible capacities
• Mixing MIR inequalities with two divisible coefficients
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
• The mixing set with divisible capacities: a simple approach
• On the separation of split cuts and related inequalities
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• A study of the lot-sizing polytope
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
• A note on the continuous mixing set
• Valid inequalities based on simple mixed-integer sets
• Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
• Mixing Sets Linked by Bidirected Paths
• The Mixing Set with Flows
• The Mixing Set with Divisible Capacities
• On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Capacitated Facility Location: Valid Inequalities and Facets
• The Continuous Mixing Polyhedron
• Mixing mixed-integer inequalities