Theory and Applications of N-Fold Integer Programming
Optimization and Control
2010-06-07 v2 Discrete Mathematics
Data Structures and Algorithms
Combinatorics
Abstract
We overview our recently introduced theory of n-fold integer programming which enables the polynomial time solution of fundamental linear and nonlinear integer programming problems in variable dimension. We demonstrate its power by obtaining the first polynomial time algorithms in several application areas including multicommodity flows and privacy in statistical databases.
Cite
@article{arxiv.0911.4191,
title = {Theory and Applications of N-Fold Integer Programming},
author = {Shmuel Onn},
journal= {arXiv preprint arXiv:0911.4191},
year = {2010}
}
Comments
IMA Volume on Mixed Integer Nonlinear Programming, Frontier Series, Springer, to appear