\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set

DOI10.1007/s10107-010-0382-6zbMath1247.90202MaRDI QIDQ2429470

Kiavash Kianfar, Atamtürk, Alper

Publication date: 27 April 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0382-6

zbMATH Keywords

mixed integer programming; facet; valid inequality; mixed-integer knapsack set

Mathematics Subject Classification ID

90C11: Mixed integer programming

Related Items

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets, \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem, Facets for continuous multi-mixing set with general coefficients and bounded integer variables, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set

Cites Work

• Unnamed Item
• Cover and pack inequalities for (mixed) integer programming
• Mingling: mixed-integer rounding with bounds
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
• The 0-1 knapsack problem with a single continuous variable
• On the facets of the mixed-integer knapsack polyhedron
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• Some polyhedra related to combinatorial problems
• Valid inequalities based on simple mixed-integer sets
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Sequence Independent Lifting for Mixed-Integer Programming
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II