Abstract
In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any convex separable objective function. We conclude with two sample applications, stochastic integer programs with second-order dominance constraints and stochastic integer multi-commodity flows, which (for fixed blocks) can be solved in polynomial time in the number of scenarios and commodities and in the binary encoding length of the input data. In the proof of our main theorem we combine several non-trivial constructions from the theory of Graver bases. We are confident that our approach paves the way for further extensions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aschenbrenner, M., Hemmecke, R.: Finiteness theorems in stochastic integer programming. Foundations of Computational Mathematics 7, 183–227 (2007)
De Loera, J.A., Hemmecke, R., Onn, S., Rothblum, U., Weismantel, R.: Convex integer maximization via Graver bases. Journal of Pure and Applied Algebra 213, 1569–1577 (2009)
De Loera, J.A., Hemmecke, R., Onn, S., Weismantel, R.: N-fold integer programming. Discrete Optimization 5, 231–241 (2008)
Diaconis, P., Graham, R., Sturmfels, B.: Primitive partition identities. In: Miklós, D., Sós, V.T., Szonyi, T. (eds.) Combinatorics, Paul Erdos is Eighty, pp. 173–192. Janos Bolyai Mathematical Society, Budapest (1996)
Gollmer, R., Gotzes, U., Schultz, R.: A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse. Mathematical Programming (to appear, 2010), doi:10.1007/s10107-009-0270-0
Graver, J.E.: On the foundation of linear and integer programming I. Mathematical Programming 9, 207–226 (1975)
Hemmecke, R.: On the positive sum property and the computation of Graver test sets. Mathematical Programming 96, 247–269 (2003)
Hemmecke, R., Onn, S., Weismantel, R.: A polynomial oracle-time algorithm for convex integer minimization. Mathematical Programming, Series A (to appear, 2010), doi:10.1007/s10107-009-0276-7
Hemmecke, R., Schultz, R.: Decomposition of test sets in stochastic integer programming. Mathematical Programming 94, 323–341 (2003)
Hoşten, S., Sullivant, S.: Finiteness theorems for Markov bases of hierarchical models. Journal of Combinatorial Theory, Series A 114(2), 311–321 (2007)
New Formulations for Optimization Under Stochastic Dominance Constraints. SIAM J. Optim. 19, 1433–1450 (2008)
Mirchandani, P.B., Soroush, H.: The stochastic multicommodity flow problem. Networks 20, 121–155 (1990)
Murota, K., Saito, H., Weismantel, R.: Optimality criterion for a class of nonlinear integer programs. Operations Research Letters 32, 468–472 (2004)
Onn, S.: Theory and Applications of N-fold Integer Programming. In: IMA Volume on Mixed Integer Nonlinear Programming. Frontier Series. Springer, Heidelberg (in preparation 2010)
Onn, S., Rothblum, U.: Convex combinatorial optimization. Discrete Computational Geometry 32, 549–566 (2004)
Powell, W.B., Topaloglu, H.: Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems. INFORMS Journal on Computing 18, 31–42 (2006)
Santos, F., Sturmfels, B.: Higher Lawrence configurations. Journal of Combinatorial Theory, Series A 103, 151–164 (2003)
Schulz, A.S., Weismantel, R.: A polynomial time augmentation algorithm for integer programming. In: Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore (1999)
Schrijver, A.: Theory of linear and integer programming. Wiley, Chichester (1986)
Seymour, P.D.: Decomposition of regular matroids. Journal of Combinatorial Theory, Series B 28, 305–359 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hemmecke, R., Köppe, M., Weismantel, R. (2010). A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-13036-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13035-9
Online ISBN: 978-3-642-13036-6
eBook Packages: Computer ScienceComputer Science (R0)