On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets

DOI10.1016/j.dam.2012.02.025zbMath1245.90065OpenAlexW2030994187MaRDI QIDQ427901

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

zbMATH Keywords

facetvalid inequality\(n\)-step mixed integer roundingcapacitated flow setinteger knapsack setpartition inequality

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Lifting for the integer knapsack cover polyhedron ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ Continuous knapsack sets with divisible capacities

Cites Work

• Unnamed Item
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• 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
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• When the Greedy Solution Solves a Class of Knapsack Problems
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II