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

DOI10.1016/J.DAM.2012.02.025MaRDI QIDQ427901zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Integer programming (90C10)

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

Cites work

• scientific article; zbMATH DE number 3470175 (Why is no real title available?)
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II
• Some polyhedra related to combinatorial problems
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• T-space and cutting planes
• The cutting stock problem and integer rounding
• Valid inequalities based on simple mixed-integer sets
• When the Greedy Solution Solves a Class of Knapsack Problems

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)