{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:16:43Z","timestamp":1781345803343,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130359","type":"print"},{"value":"9783642130366","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_17","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:36:09Z","timestamp":1276000569000},"page":"219-229","source":"Crossref","is-referenced-by-count":12,"title":["A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs"],"prefix":"10.1007","author":[{"given":"Raymond","family":"Hemmecke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"K\u00f6ppe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10208-005-0174-1","volume":"7","author":"M. Aschenbrenner","year":"2007","unstructured":"Aschenbrenner, M., Hemmecke, R.: Finiteness theorems in stochastic integer programming. Foundations of Computational Mathematics\u00a07, 183\u2013227 (2007)","journal-title":"Foundations of Computational Mathematics"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1016\/j.jpaa.2008.11.033","volume":"213","author":"J.A. Loera De","year":"2009","unstructured":"De Loera, J.A., Hemmecke, R., Onn, S., Rothblum, U., Weismantel, R.: Convex integer maximization via Graver bases. Journal of Pure and Applied Algebra\u00a0213, 1569\u20131577 (2009)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.disopt.2006.06.006","volume":"5","author":"J.A. Loera De","year":"2008","unstructured":"De Loera, J.A., Hemmecke, R., Onn, S., Weismantel, R.: N-fold integer programming. Discrete Optimization\u00a05, 231\u2013241 (2008)","journal-title":"Discrete Optimization"},{"key":"17_CR4","first-page":"173","volume-title":"Combinatorics, Paul Erdos is Eighty","author":"P. Diaconis","year":"1996","unstructured":"Diaconis, P., Graham, R., Sturmfels, B.: Primitive partition identities. In: Mikl\u00f3s, D., S\u00f3s, V.T., Szonyi, T. (eds.) Combinatorics, Paul Erdos is Eighty, pp. 173\u2013192. Janos Bolyai Mathematical Society, Budapest (1996)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/s10107-009-0270-0"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01681344","volume":"9","author":"J.E. Graver","year":"1975","unstructured":"Graver, J.E.: On the foundation of linear and integer programming I. Mathematical Programming\u00a09, 207\u2013226 (1975)","journal-title":"Mathematical Programming"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-003-0385-7","volume":"96","author":"R. Hemmecke","year":"2003","unstructured":"Hemmecke, R.: On the positive sum property and the computation of Graver test sets. Mathematical Programming\u00a096, 247\u2013269 (2003)","journal-title":"Mathematical Programming"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/s10107-009-0276-7"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10107-002-0322-1","volume":"94","author":"R. Hemmecke","year":"2003","unstructured":"Hemmecke, R., Schultz, R.: Decomposition of test sets in stochastic integer programming. Mathematical Programming\u00a094, 323\u2013341 (2003)","journal-title":"Mathematical Programming"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.jcta.2006.06.001","volume":"114","author":"S. Ho\u015ften","year":"2007","unstructured":"Ho\u015ften, S., Sullivant, S.: Finiteness theorems for Markov bases of hierarchical models. Journal of Combinatorial Theory, Series A\u00a0114(2), 311\u2013321 (2007)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1137\/070707956","volume":"19","author":"New Formulations for Optimization Under Stochastic Dominance Constraints","year":"2008","unstructured":"New Formulations for Optimization Under Stochastic Dominance Constraints. SIAM J. Optim.\u00a019, 1433\u20131450 (2008)","journal-title":"SIAM J. Optim."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/net.3230200202","volume":"20","author":"P.B. Mirchandani","year":"1990","unstructured":"Mirchandani, P.B., Soroush, H.: The stochastic multicommodity flow problem. Networks\u00a020, 121\u2013155 (1990)","journal-title":"Networks"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.orl.2003.11.007","volume":"32","author":"K. Murota","year":"2004","unstructured":"Murota, K., Saito, H., Weismantel, R.: Optimality criterion for a class of nonlinear integer programs. Operations Research Letters\u00a032, 468\u2013472 (2004)","journal-title":"Operations Research Letters"},{"key":"17_CR14","series-title":"Frontier Series","volume-title":"IMA Volume on Mixed Integer Nonlinear Programming","author":"S. Onn","year":"2010","unstructured":"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)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00454-004-1138-y","volume":"32","author":"S. Onn","year":"2004","unstructured":"Onn, S., Rothblum, U.: Convex combinatorial optimization. Discrete Computational Geometry\u00a032, 549\u2013566 (2004)","journal-title":"Discrete Computational Geometry"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/ijoc.1040.0079","volume":"18","author":"W.B. Powell","year":"2006","unstructured":"Powell, W.B., Topaloglu, H.: Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems. INFORMS Journal on Computing\u00a018, 31\u201342 (2006)","journal-title":"INFORMS Journal on Computing"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0097-3165(03)00092-X","volume":"103","author":"F. Santos","year":"2003","unstructured":"Santos, F., Sturmfels, B.: Higher Lawrence configurations. Journal of Combinatorial Theory, Series A\u00a0103, 151\u2013164 (2003)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"17_CR18","unstructured":"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)"},{"key":"17_CR19","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley, Chichester (1986)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. Journal of Combinatorial Theory, Series B\u00a028, 305\u2013359 (1980)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13036-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:51:57Z","timestamp":1619783517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}