{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:16:42Z","timestamp":1781345802859,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,2,16]],"date-time":"2013-02-16T00:00:00Z","timestamp":1360972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10107-013-0638-z","type":"journal-article","created":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T02:58:13Z","timestamp":1360897093000},"page":"1-18","source":"Crossref","is-referenced-by-count":16,"title":["Graver basis and proximity techniques for block-structured separable convex integer minimization problems"],"prefix":"10.1007","volume":"145","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","published-online":{"date-parts":[[2013,2,16]]},"reference":[{"key":"638_CR1","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1016\/j.jpaa.2008.11.033","volume":"213","author":"JA Loera De","year":"2009","unstructured":"De Loera, J.A., Hemmecke, R., Onn, S., Rothblum, U.G., Weismantel, R.: Convex integer maximization via Graver bases. J. Pure Appl. Algebra 213, 1569\u20131577 (2009)","journal-title":"J. Pure Appl. Algebra"},{"key":"638_CR2","doi-asserted-by":"crossref","unstructured":"De Loera, J.A., Hemmecke, R., Onn, S., Weismantel, R.: $N$-fold integer programming. Discret. Optim. 5(2), 231\u2013241 (2008) doi: 10.1016\/j.disopt.2006.06.006 (In Memory of George B. Dantzig)","DOI":"10.1016\/j.disopt.2006.06.006"},{"key":"638_CR3","unstructured":"Diaconis, P., Graham, R. L., Sturmfels, B.: Primitive partition identities. In: Mikl\u00f3s, D., S\u00f3s, V.T., Sz\u0151nyi, D. (eds.), Combinatorics, Paul Erd\u0151s is Eighty, Volume 2. Bolyai Society Mathematical Studies, vol. 2, pp. 173\u2013192 (1996)"},{"key":"638_CR4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10107-009-0270-0","volume":"126","author":"R Gollmer","year":"2011","unstructured":"Gollmer, R., Gotzes, U., Schultz, R.: A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse. Math. Program. 126, 179\u2013190 (2011)","journal-title":"Math. Program."},{"key":"638_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01681344","volume":"8","author":"JE Graver","year":"1975","unstructured":"Graver, J.E.: On the foundations of linear and integer linear programming I. Math. Program. 8, 207\u2013226 (1975)","journal-title":"Math. Program."},{"key":"638_CR6","unstructured":"Hemmecke, R.: Test sets for integer programs with $\\mathbb{Z}$-convex objective. eprint arXiv:math\/0309154 (2003)"},{"key":"638_CR7","doi-asserted-by":"crossref","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. Math. Program. Ser. B 96, 247\u2013269 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"638_CR8","doi-asserted-by":"crossref","unstructured":"Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: 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. Lecture Notes in Computer Science, vol. 6080, Springer, Berlin, pp. 219\u2013229 (2010). doi: 10.1007\/978-3-642-13036-6_17","DOI":"10.1007\/978-3-642-13036-6_17"},{"key":"638_CR9","doi-asserted-by":"crossref","unstructured":"Hemmecke, R., Onn, S., Romanchuk, L.: $N$-fold integer programming in cubic time. Math. Program. 1\u201317 (2011). doi: 10.1007\/s10107-011-0490-y","DOI":"10.1007\/s10107-011-0490-y"},{"key":"638_CR10","doi-asserted-by":"crossref","unstructured":"Hemmecke, R., Onn, S., Weismantel, R.: A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126, 97\u2013117 (2011). doi: 10.1007\/s10107-009-0276-7","DOI":"10.1007\/s10107-009-0276-7"},{"issue":"2\u20133","key":"638_CR11","doi-asserted-by":"crossref","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. Math. Program. 94(2\u20133), 323\u2013341 (2003)","journal-title":"Math. Program."},{"key":"638_CR12","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/moor.19.2.390","volume":"19","author":"DS Hochbaum","year":"1994","unstructured":"Hochbaum, D.S.: Lower and upper bounds for allocation problems. Math. Oper. Res. 19, 390\u2013409 (1994)","journal-title":"Math. Oper. Res."},{"key":"638_CR13","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization, J. ACM 37, 843\u2013862 (1990). doi: 10.1145\/96559.96597","DOI":"10.1145\/96559.96597"},{"key":"638_CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BFb0121104","volume":"26","author":"M Minoux","year":"1986","unstructured":"Minoux, M.: Solving integer minimum cost flows with separable convex cost objective polynomially. Math. Prog. Study 26, 237\u2013239 (1986)","journal-title":"Math. Prog. Study"},{"key":"638_CR15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/net.3230200202","volume":"20","author":"P Mirchandani","year":"1990","unstructured":"Mirchandani, P., Soroush, H.: The stochastic multicommodity flow problem. Networks 20, 121\u2013155 (1990)","journal-title":"Networks"},{"key":"638_CR16","doi-asserted-by":"crossref","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. Oper. Res. Lett. 32, 468\u2013472 (2004)","journal-title":"Oper. Res. Lett."},{"key":"638_CR17","doi-asserted-by":"crossref","unstructured":"Onn, S.: Nonlinear Discrete Optimization. Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010)","DOI":"10.4171\/093"},{"key":"638_CR18","doi-asserted-by":"crossref","unstructured":"Onn, S.: Theory and applications of $N$-fold integer programming. In: The IMA Volumes in Mathematics and its Applications, Mixed Integer Nonlinear Programming, pp. 559\u2013593. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-1927-3_20"},{"key":"638_CR19","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s00454-004-1138-y","volume":"32","author":"S Onn","year":"2004","unstructured":"Onn, S., Rothblum, U.G.: Convex combinatorial optimization. Disc. Comp. Geom. 32, 549\u2013566 (2004)","journal-title":"Disc. Comp. Geom."},{"key":"638_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/ijoc.1040.0079","volume":"18","author":"W Powell","year":"2006","unstructured":"Powell, W., Topaloglu, H.: Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS J. Comput. 18, 31\u201342 (2006)","journal-title":"INFORMS J. Comput."},{"key":"638_CR21","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"638_CR22","unstructured":"Schulz, A.S., Weismantel, R.: An oracle-polynomial time augmentation algorithm for integer programming. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 967\u2013968 (1999)"},{"key":"638_CR23","doi-asserted-by":"crossref","unstructured":"Schulz, A.S., Weismantel, R., Ziegler, G.M.: 0\/1 integer programming: optimization and augmentation are equivalent. In: Spirakis, P. (ed.), Algorithms-ESA 95, Lecture Notes in Computer Science, vol. 979, Springer, Berlin, pp. 473\u2013483 (1995)","DOI":"10.1007\/3-540-60313-1_164"},{"key":"638_CR24","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Comb. Theory 28, 305\u2013359 (1980)","journal-title":"J. Comb. Theory"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0638-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0638-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0638-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:02Z","timestamp":1559124002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0638-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,16]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["638"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0638-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,16]]}}}