Mixing MIR inequalities with two divisible coefficients

DOI10.1007/s10107-009-0266-9zbMath1247.90203OpenAlexW1982870974MaRDI QIDQ964181

Mathieu Van Vyve, Andrew J. Miller, Miguel Fragoso Constantino

Publication date: 15 April 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0266-9

zbMATH Keywords

polynomial time algorithmconvex hullvalid inequalitiesmixing proceduremixed integer setsingle-item lot-sizing model

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Covering Linear Programming with Violations, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set, The Mixing Set with Divisible Capacities, The mixing-MIR set with divisible capacities, Mixing polyhedra with two non divisible coefficients, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens

Cites Work

• Unnamed Item
• Lifting two-integer knapsack inequalities
• The mixing-MIR set with divisible capacities
• The mixing set with divisible capacities: a simple approach
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Polyhedra for lot-sizing with Wagner-Whitin costs
• A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
• Description of 2-integer continuous knapsack polyhedra
• Lower Bounds in Lot-Sizing Models: A Polyhedral Study
• Integer Programming and Pricing
• The Mixing Set with Divisible Capacities
• Disjunctive Programming
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Mixing mixed-integer inequalities