We provide a complexity classification of four variants of robust integer programming when the underlying Graver basis is given. We discuss applications to robust multicommodity flows and multidimensional transportation, and describe an effective parametrization of robust integer programming.
Cite
@article{arxiv.1402.2852,
title = {Robust Integer Programming},
author = {Shmuel Onn},
journal= {arXiv preprint arXiv:1402.2852},
year = {2014}
}