On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
From MaRDI portal
Publication:427901
DOI10.1016/J.DAM.2012.02.025zbMATH Open1245.90065OpenAlexW2030994187MaRDI QIDQ427901FDOQ427901
Authors: Kiavash Kianfar 
Publication date: 18 June 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.02.025
Recommendations
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Cover and pack inequalities for (mixed) integer programming
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Valid inequalities based on simple mixed-integer sets
facetvalid inequality\(n\)-step mixed integer roundingcapacitated flow setinteger knapsack setpartition inequality
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- T-space and cutting planes
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Some polyhedra related to combinatorial problems
- Valid inequalities based on simple mixed-integer sets
- The cutting stock problem and integer rounding
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Title not available (Why is that?)
- When the Greedy Solution Solves a Class of Knapsack Problems
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
Cited In (5)
- Continuous knapsack sets with divisible capacities
- Lifting for the integer knapsack cover polyhedron
- Valid inequalities and facets for multi‐module survivable network design problem
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
This page was built for publication: On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427901)
