• Corpus ID: 245836914

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

  title={A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees},
  author={Adam Jozefiak and F. Bruce Shepherd and Noah Weninger},
We introduce a natural knapsack intersection hierarchy for strengthening linear programming relaxations of packing integer programs, i.e., max{wx : x ∈ P ∩{0, 1}} where P = {x ∈ [0, 1] : Ax ≤ b} and A, b, w ≥ 0. The t level P t corresponds to adding cuts associated with the integer hull of the intersection of any t knapsack constraints (rows of the constraint matrix). This model captures the maximum possible strength of “t-row cuts”, an approach often used by solvers for small t. If A is m × n… 

Figures from this paper


Multicommodity demand flow in a tree and packing integer programs
This paper considers requests for capacity in a given tree network T = (V, E) where each edge e of the tree has some integer capacity ue and establishes that the integrality gap of the natural linear programming relaxation is at most 4 for the case of arbitrary profits.
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
These are the first non-trivial approximations for UFP on trees when all weights are identical; this yields an O (log2 n ) approximation for the weighted case.
On Linear Programming Relaxations for Unsplittable Flow in Trees
A relaxation with polynomially many constraints that has an integrality gap bound of O(log n * min(log m, log n), which matches the approximation guarantee of their combinatorial algorithm and is the first demonstration of an efficiently-solvable relaxation for UFP-Tree with a sub-linear integralities gap.
Computing with Multi-Row Intersection Cuts
A small subset of multi-row intersection cuts based on the infinity norm, which works for relaxations with arbitrary numbers of rows, and is concluded that these cuts yield benefits comparable to using the entire class ofmulti-row cuts, but at a small fraction of the computational cost.
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
A constant-factor approximation algorithm for the unsplittable flow problem on a path which improves on the previous best known approximation factor of O(log n), and introduces several novel algorithmic techniques, which might be of independent interest.
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack
This paper introduces a technique to obtain real PTAS from PTASs with resource augmentation where edge capacities can be violated by a 1 + e factor and leads to a PTAS for the rooted case of UFP, where all tasks share a common edge.
Chvátal closures for mixed integer programming problems
A finite recursive procedure for generating the mixed integer hull of a polyhedron is obtained, analogous to the process of repeatedly taking Chvátal closures in the integer programming case.
Polyhedral properties for the intersection of two knapsacks
The notion of an incomplete set inequality which is based on a combinatorial principle for the intersection of two knapsacks is introduced and schemes to compute nontrivial bounds for the strength of such inequalities are outlined.
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
First, it is shown that an integrality gap of 2 - e persists up to a linear number of rounds of Sherali-Adams, despite the fact that Knapsack admits a fully polynomial time approximation scheme, and second, the Lasserre hierarchy closes the gap quickly.
Approximation Algorithms for the Unsplittable Flow Problem
The main technique used for these results is randomized rounding followed by greedy alteration, and is inspired by the use of this idea in recent work.