Mixed n-step MIR inequalities: facets for the n-mixing set
From MaRDI portal
Publication:1926486
DOI10.1016/J.DISOPT.2012.07.003zbMATH Open1281.90030OpenAlexW2140461237MaRDI QIDQ1926486FDOQ1926486
Authors: Sujeevraja Sanjeevi, Kiavash Kianfar 
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
Recommendations
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Two-step MIR inequalities for mixed integer programs
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- Mingling: mixed-integer rounding with bounds
mixingcutting planesmixed integer programmingmixed \(n\)-step MIRmulti-module capacitated facility locationmulti-module capacitated lot-sizing
Cites Work
- Title not available (Why is that?)
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Valid inequalities based on simple mixed-integer sets
- Title not available (Why is that?)
- A study of the lot-sizing polytope
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Mixing mixed-integer inequalities
- Capacitated Facility Location: Valid Inequalities and Facets
- Title not available (Why is that?)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- On the exact separation of mixed integer knapsack cuts
- On the separation of split cuts and related inequalities
- On mixing inequalities: rank, closure, and cutting-plane proofs
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- A note on the split rank of intersection cuts
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
- Aggregation and Mixed Integer Rounding to Solve MIPs
- The Mixing Set with Flows
- The Continuous Mixing Polyhedron
- The mixing set with divisible capacities: a simple approach
- The Mixing Set with Divisible Capacities
- The mixing-MIR set with divisible capacities
- Mixing MIR inequalities with two divisible coefficients
- A note on the continuous mixing set
- Mixing sets linked by bidirected paths
Cited In (18)
- Discrete multi-module capacitated lot-sizing problems with multiple items
- 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
- Two-step MIR inequalities for mixed integer programs
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- The mixing-MIR set with divisible capacities
- Mixing MIR inequalities with two divisible coefficients
- Theoretical challenges towards cutting-plane selection
- 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
- Capacitated lot-sizing problem with outsourcing
- On mixing inequalities: rank, closure, and cutting-plane proofs
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- Valid inequalities based on simple mixed-integer sets
- \(N\)-step cycle inequalities: facets for continuous \(n\)-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- Lot sizing with piecewise concave production costs
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
Uses Software
This page was built for publication: Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926486)
