The aggregation closure is polyhedral for packing and covering integer programs

DOI10.1007/s10107-021-01723-1zbMath1504.90075arXiv1910.03404OpenAlexW3209775182MaRDI QIDQ2089800

Haripriya Pulyassary, Laurent Poirrier, Kanstantsin Pashkovich

Publication date: 24 October 2022

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

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

zbMATH Keywords

polyhedralaggregation closure

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the exact separation of mixed integer knapsack cuts
• Chvátal closures for mixed integer programming problems
• On the strength of Gomory mixed-integer cuts as group cuts
• Disjunctive programming: Properties of the convex hull of feasible points
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Intersection cuts for single row corner relaxations
• On the relative strength of different generalizations of split cuts
• Aggregation-based cutting-planes for packing and covering integer programs
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• On finitely generated closures in the theory of cutting planes
• Lattice closures of polyhedra
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• Integer packing sets form a well-quasi-ordering
• Integer Programming
• Outline of an algorithm for integer solutions to linear programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Solving Large-Scale Zero-One Linear Programming Problems
• Lifting the facets of zero–one polytopes
• On Cutting Planes
• Faces for a linear inequality in 0–1 variables
• Inequalities from Two Rows of a Simplex Tableau
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II

This page was built for publication: The aggregation closure is polyhedral for packing and covering integer programs