Mixing MIR inequalities with two divisible coefficients
From MaRDI portal
Publication:964181
DOI10.1007/s10107-009-0266-9zbMath1247.90203MaRDI QIDQ964181
Mathieu Van Vyve, Miguel Fragoso Constantino, Andrew J. Miller
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
polynomial time algorithm; convex hull; valid inequalities; mixing procedure; mixed integer set; single-item lot-sizing model
Related Items
Mixing polyhedra with two non divisible coefficients, The mixing-MIR set with divisible capacities, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set, Covering Linear Programming with Violations, The Mixing Set with Divisible Capacities
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