A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Evaluating and Tuning n-fold Integer Programming
[article]
2018
arXiv
pre-print
In recent years, algorithmic breakthroughs in stringology, computational social choice, scheduling, etc., were achieved by applying the theory of so-called n-fold integer programming. An n-fold integer program (IP) has a highly uniform block structured constraint matrix. Hemmecke, Onn, and Romanchuk [Math. Programming, 2013] showed an algorithm with runtime a^O(rst + r^2s) n^3, where a is the largest coefficient, r,s, and t are dimensions of blocks of the constraint matrix and n is the total
arXiv:1802.09007v1
fatcat:ps6brca3cbgopmnv5qkp642pay