
FRaGenLP: A Generator of Random Linear Programming Problems for Cluster Computing Systems
The article presents and evaluates a scalable FRaGenLP algorithm for gen...
read it

Windowed Prophet Inequalities
The prophet inequalities problem has received significant study over the...
read it

On bounded pitch inequalities for the minknapsack polytope
In the minknapsack problem one aims at choosing a set of objects with m...
read it

Improved Formulations and Branchandcut Algorithms for the Angular Constrained Minimum Spanning Tree Problem
The Angular Constrained Minimum Spanning Tree Problem (αMSTP) is define...
read it

On the Integrality Gap of Binary Integer Programs with Gaussian Data
For a binary integer program (IP) max c^𝖳 x, Ax ≤ b, x ∈{0,1}^n, where A...
read it

Euclidean ForwardReverse BrascampLieb Inequalities: Finiteness, Structure and Extremals
A new proof is given for the fact that centered gaussian functions satur...
read it

Integrity Constraints Revisited: From Exact to Approximate Implication
Integrity constraints such as functional dependences (FD), and multival...
read it
Comb inequalities for typical Euclidean TSP instances
We prove that even in average case, the Euclidean Traveling Salesman Problem exhibits an integrality gap of (1+ϵ) for ϵ>0 when the HeldKarp Linear Programming relaxation is augmented by all comb inequalities of bounded size. This implies that large classes of branchandcut algorithms take exponential time for the Euclidean TSP, even on random inputs.
READ FULL TEXT
Comments
There are no comments yet.