A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees

Adam Jozefiak, F. Bruce Shepherd, Noah Weninger

We introduce a natural knapsack intersection hierarchy for strengthening linear programming relaxations of packing integer programs, i.e., $\max \{w^{T}x:x\in P\cap \{0,1{\}}^n\}$ where…