Aggregation-based cutting-planes for packing and covering integer programs

DOI10.1007/s10107-017-1192-xzbMath1405.90080arXiv1606.08951OpenAlexW2963606456MaRDI QIDQ1785202

Marco Molinaro, Sebastian Pokutta, Alberto Del Pia, Santanu S. Dey, Merve Bodur

Publication date: 28 September 2018

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

Full work available at URL: https://arxiv.org/abs/1606.08951

zbMATH Keywords

aggregationcoveringinteger programmingpackingcutting planes

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (11)

On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity ⋮ Two-halfspace closure ⋮ Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation ⋮ Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs ⋮ The strength of multi-row aggregation cuts for sign-pattern integer programs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Multi-cover inequalities for totally-ordered multiple knapsack sets ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs ⋮ The aggregation closure is polyhedral for packing and covering integer programs ⋮ On a generalization of the Chvátal-Gomory closure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some properties of convex hulls of integer points contained in general convex sets
• On the exact separation of mixed integer knapsack cuts
• Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
• Cutting planes in integer and mixed integer programming
• Optimizing over the first Chvátal closure
• On cutting-plane proofs in combinatorial optimization
• On the \(0/1\) knapsack polytope
• Worst-case comparison of valid inequalities for the TSP
• Approximate fixed-rank closures of covering problems
• Integer Programming
• Reverse Chvátal--Gomory Rank
• Mixed Integer Programming Computation
• The Group-Theoretic Approach in Mixed Integer Programming
• On the Rank of Cutting-Plane Proof Systems
• Improving Integrality Gaps via Chvátal-Gomory Rounding
• 50 Years of Integer Programming 1958-2008
• Lifting the facets of zero–one polytopes
• On Cutting Planes
• Faces for a linear inequality in 0–1 variables
• The Malinvaud Eigenvalue Lemma: Correction and Amplification
• A Class of Hard Small 0-1 Programs
• 0/1 Polytopes with Quadratic Chvátal Rank
• Improved Approximation Guarantees for Packing and Covering Integer Programs

This page was built for publication: Aggregation-based cutting-planes for packing and covering integer programs