Robust Integer Programming
classification
🧮 math.OC
cs.DMcs.DSmath.CO
keywords
robustintegerprogrammingapplicationsbasisclassificationcomplexitydescribe
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.